H-Termination proof of /home/matraf/haskell/eval_FullyBlown

NO 177.494 H-Termination proof of /home/matraf/haskell/eval_FullyBlown_Fast/empty.hs
H-Termination of the given Haskell-Program with start terms could successfully be disproven:

↳ HASKELL

  ↳ BR

mainModule Main

((enumFromThenTo :: Char -> Char -> Char -> [Char]) :: Char -> Char -> Char -> [Char])

module Main where

import qualified Prelude

Replaced joker patterns by fresh variables and removed binding patterns.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

mainModule Main

((enumFromThenTo :: Char -> Char -> Char -> [Char]) :: Char -> Char -> Char -> [Char])

module Main where

import qualified Prelude

Cond Reductions:
The following Function with conditions

undefined

| False

= undefined

is transformed to

undefined = undefined1

undefined0 True = undefined

undefined1 = undefined0 False

The following Function with conditions

p

| n' >= n

= flip (<=) m

| otherwise

= flip (>=) m

is transformed to

p = p2

p0 True = flip (>=) m

p1 True = flip (<=) m

p1 False = p0 otherwise

p2 = p1 (n' >= n)

The following Function with conditions

takeWhile p [] = []

takeWhile p (x : xs)

| p x

= x : takeWhile p xs

| otherwise

= []

is transformed to

takeWhile p [] = takeWhile3 p []

takeWhile p (x : xs) = takeWhile2 p (x : xs)

takeWhile0 p x xs True = []

takeWhile1 p x xs True = x : takeWhile p xs

takeWhile1 p x xs False = takeWhile0 p x xs otherwise

takeWhile2 p (x : xs) = takeWhile1 p x xs (p x)

takeWhile3 p [] = []

takeWhile3 vz wu = takeWhile2 vz wu

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

mainModule Main

((enumFromThenTo :: Char -> Char -> Char -> [Char]) :: Char -> Char -> Char -> [Char])

module Main where

import qualified Prelude

Let/Where Reductions:
The bindings of the following Let/Where expression

takeWhile p (numericEnumFromThen n n')

where

p = p2

p0 True = flip (>=) m

p1 True = flip (<=) m

p1 False = p0 otherwise

p2 = p1 (n' >= n)

are unpacked to the following functions on top level

numericEnumFromThenToP1 wv ww wx True = flip (<=) wv

numericEnumFromThenToP1 wv ww wx False = numericEnumFromThenToP0 wv ww wx otherwise

numericEnumFromThenToP0 wv ww wx True = flip (>=) wv

numericEnumFromThenToP2 wv ww wx = numericEnumFromThenToP1 wv ww wx (ww >= wx)

numericEnumFromThenToP wv ww wx = numericEnumFromThenToP2 wv ww wx

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

              ↳ Narrow

mainModule Main

(enumFromThenTo :: Char -> Char -> Char -> [Char])

module Main where

import qualified Prelude

Haskell To QDPs

digraph dp_graph {
node [outthreshold=100, inthreshold=100];1[label="enumFromThenTo",fontsize=16,color="grey",shape="box"];1 -> 3[label="",style="dashed", color="grey", weight=3];
3[label="enumFromThenTo wy3",fontsize=16,color="grey",shape="box"];3 -> 4[label="",style="dashed", color="grey", weight=3];
4[label="enumFromThenTo wy3 wy4",fontsize=16,color="grey",shape="box"];4 -> 5[label="",style="dashed", color="grey", weight=3];
5[label="enumFromThenTo wy3 wy4 wy5",fontsize=16,color="black",shape="triangle"];5 -> 6[label="",style="solid", color="black", weight=3];
6[label="map toEnum (enumFromThenTo (fromEnum wy3) (fromEnum wy4) (fromEnum wy5))",fontsize=16,color="black",shape="box"];6 -> 7[label="",style="solid", color="black", weight=3];
7[label="map toEnum (numericEnumFromThenTo (fromEnum wy3) (fromEnum wy4) (fromEnum wy5))",fontsize=16,color="black",shape="box"];7 -> 8[label="",style="solid", color="black", weight=3];
8[label="map toEnum (takeWhile (numericEnumFromThenToP (fromEnum wy5) (fromEnum wy4) (fromEnum wy3)) (numericEnumFromThen (fromEnum wy3) (fromEnum wy4)))",fontsize=16,color="black",shape="box"];8 -> 9[label="",style="solid", color="black", weight=3];
9[label="map toEnum (takeWhile (numericEnumFromThenToP (fromEnum wy5) (fromEnum wy4) (fromEnum wy3)) (iterate (fromEnum wy4 - fromEnum wy3 +) (fromEnum wy3)))",fontsize=16,color="black",shape="box"];9 -> 10[label="",style="solid", color="black", weight=3];
10[label="map toEnum (takeWhile (numericEnumFromThenToP (fromEnum wy5) (fromEnum wy4) (fromEnum wy3)) (fromEnum wy3 : iterate (fromEnum wy4 - fromEnum wy3 +) (fromEnum wy4 - fromEnum wy3 + fromEnum wy3)))",fontsize=16,color="black",shape="box"];10 -> 11[label="",style="solid", color="black", weight=3];
11[label="map toEnum (takeWhile2 (numericEnumFromThenToP (fromEnum wy5) (fromEnum wy4) (fromEnum wy3)) (fromEnum wy3 : iterate (fromEnum wy4 - fromEnum wy3 +) (fromEnum wy4 - fromEnum wy3 + fromEnum wy3)))",fontsize=16,color="black",shape="box"];11 -> 12[label="",style="solid", color="black", weight=3];
12[label="map toEnum (takeWhile1 (numericEnumFromThenToP (fromEnum wy5) (fromEnum wy4) (fromEnum wy3)) (fromEnum wy3) (iterate (fromEnum wy4 - fromEnum wy3 +) (fromEnum wy4 - fromEnum wy3 + fromEnum wy3)) (numericEnumFromThenToP (fromEnum wy5) (fromEnum wy4) (fromEnum wy3) (fromEnum wy3)))",fontsize=16,color="black",shape="box"];12 -> 13[label="",style="solid", color="black", weight=3];
13[label="map toEnum (takeWhile1 (numericEnumFromThenToP2 (fromEnum wy5) (fromEnum wy4) (fromEnum wy3)) (fromEnum wy3) (iterate (fromEnum wy4 - fromEnum wy3 +) (fromEnum wy4 - fromEnum wy3 + fromEnum wy3)) (numericEnumFromThenToP2 (fromEnum wy5) (fromEnum wy4) (fromEnum wy3) (fromEnum wy3)))",fontsize=16,color="black",shape="box"];13 -> 14[label="",style="solid", color="black", weight=3];
14[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy5) (fromEnum wy4) (fromEnum wy3) (fromEnum wy4 >= fromEnum wy3)) (fromEnum wy3) (iterate (fromEnum wy4 - fromEnum wy3 +) (fromEnum wy4 - fromEnum wy3 + fromEnum wy3)) (numericEnumFromThenToP1 (fromEnum wy5) (fromEnum wy4) (fromEnum wy3) (fromEnum wy4 >= fromEnum wy3) (fromEnum wy3)))",fontsize=16,color="black",shape="box"];14 -> 15[label="",style="solid", color="black", weight=3];
15[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy5) (fromEnum wy4) (fromEnum wy3) (compare (fromEnum wy4) (fromEnum wy3) /= LT)) (fromEnum wy3) (iterate (fromEnum wy4 - fromEnum wy3 +) (fromEnum wy4 - fromEnum wy3 + fromEnum wy3)) (numericEnumFromThenToP1 (fromEnum wy5) (fromEnum wy4) (fromEnum wy3) (compare (fromEnum wy4) (fromEnum wy3) /= LT) (fromEnum wy3)))",fontsize=16,color="black",shape="box"];15 -> 16[label="",style="solid", color="black", weight=3];
16[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy5) (fromEnum wy4) (fromEnum wy3) (not (compare (fromEnum wy4) (fromEnum wy3) == LT))) (fromEnum wy3) (iterate (fromEnum wy4 - fromEnum wy3 +) (fromEnum wy4 - fromEnum wy3 + fromEnum wy3)) (numericEnumFromThenToP1 (fromEnum wy5) (fromEnum wy4) (fromEnum wy3) (not (compare (fromEnum wy4) (fromEnum wy3) == LT)) (fromEnum wy3)))",fontsize=16,color="black",shape="box"];16 -> 17[label="",style="solid", color="black", weight=3];
17[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy5) (fromEnum wy4) (fromEnum wy3) (not (primCmpInt (fromEnum wy4) (fromEnum wy3) == LT))) (fromEnum wy3) (iterate (fromEnum wy4 - fromEnum wy3 +) (fromEnum wy4 - fromEnum wy3 + fromEnum wy3)) (numericEnumFromThenToP1 (fromEnum wy5) (fromEnum wy4) (fromEnum wy3) (not (primCmpInt (fromEnum wy4) (fromEnum wy3) == LT)) (fromEnum wy3)))",fontsize=16,color="black",shape="box"];17 -> 18[label="",style="solid", color="black", weight=3];
18[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy5) (primCharToInt wy4) (fromEnum wy3) (not (primCmpInt (primCharToInt wy4) (fromEnum wy3) == LT))) (fromEnum wy3) (iterate (primCharToInt wy4 - fromEnum wy3 +) (primCharToInt wy4 - fromEnum wy3 + fromEnum wy3)) (numericEnumFromThenToP1 (fromEnum wy5) (primCharToInt wy4) (fromEnum wy3) (not (primCmpInt (primCharToInt wy4) (fromEnum wy3) == LT)) (fromEnum wy3)))",fontsize=16,color="burlywood",shape="box"];18290[label="wy4/Char wy40",fontsize=10,color="white",style="solid",shape="box"];18 -> 18290[label="",style="solid", color="burlywood", weight=9];
18290 -> 19[label="",style="solid", color="burlywood", weight=3];
19[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy5) (primCharToInt (Char wy40)) (fromEnum wy3) (not (primCmpInt (primCharToInt (Char wy40)) (fromEnum wy3) == LT))) (fromEnum wy3) (iterate (primCharToInt (Char wy40) - fromEnum wy3 +) (primCharToInt (Char wy40) - fromEnum wy3 + fromEnum wy3)) (numericEnumFromThenToP1 (fromEnum wy5) (primCharToInt (Char wy40)) (fromEnum wy3) (not (primCmpInt (primCharToInt (Char wy40)) (fromEnum wy3) == LT)) (fromEnum wy3)))",fontsize=16,color="black",shape="box"];19 -> 20[label="",style="solid", color="black", weight=3];
20[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy5) (Pos wy40) (fromEnum wy3) (not (primCmpInt (Pos wy40) (fromEnum wy3) == LT))) (fromEnum wy3) (iterate (Pos wy40 - fromEnum wy3 +) (Pos wy40 - fromEnum wy3 + fromEnum wy3)) (numericEnumFromThenToP1 (fromEnum wy5) (Pos wy40) (fromEnum wy3) (not (primCmpInt (Pos wy40) (fromEnum wy3) == LT)) (fromEnum wy3)))",fontsize=16,color="burlywood",shape="box"];18291[label="wy40/Succ wy400",fontsize=10,color="white",style="solid",shape="box"];20 -> 18291[label="",style="solid", color="burlywood", weight=9];
18291 -> 21[label="",style="solid", color="burlywood", weight=3];
18292[label="wy40/Zero",fontsize=10,color="white",style="solid",shape="box"];20 -> 18292[label="",style="solid", color="burlywood", weight=9];
18292 -> 22[label="",style="solid", color="burlywood", weight=3];
21[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy5) (Pos (Succ wy400)) (fromEnum wy3) (not (primCmpInt (Pos (Succ wy400)) (fromEnum wy3) == LT))) (fromEnum wy3) (iterate (Pos (Succ wy400) - fromEnum wy3 +) (Pos (Succ wy400) - fromEnum wy3 + fromEnum wy3)) (numericEnumFromThenToP1 (fromEnum wy5) (Pos (Succ wy400)) (fromEnum wy3) (not (primCmpInt (Pos (Succ wy400)) (fromEnum wy3) == LT)) (fromEnum wy3)))",fontsize=16,color="black",shape="box"];21 -> 23[label="",style="solid", color="black", weight=3];
22[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy5) (Pos Zero) (fromEnum wy3) (not (primCmpInt (Pos Zero) (fromEnum wy3) == LT))) (fromEnum wy3) (iterate (Pos Zero - fromEnum wy3 +) (Pos Zero - fromEnum wy3 + fromEnum wy3)) (numericEnumFromThenToP1 (fromEnum wy5) (Pos Zero) (fromEnum wy3) (not (primCmpInt (Pos Zero) (fromEnum wy3) == LT)) (fromEnum wy3)))",fontsize=16,color="black",shape="box"];22 -> 24[label="",style="solid", color="black", weight=3];
23[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy5) (Pos (Succ wy400)) (primCharToInt wy3) (not (primCmpInt (Pos (Succ wy400)) (primCharToInt wy3) == LT))) (primCharToInt wy3) (iterate (Pos (Succ wy400) - primCharToInt wy3 +) (Pos (Succ wy400) - primCharToInt wy3 + primCharToInt wy3)) (numericEnumFromThenToP1 (fromEnum wy5) (Pos (Succ wy400)) (primCharToInt wy3) (not (primCmpInt (Pos (Succ wy400)) (primCharToInt wy3) == LT)) (primCharToInt wy3)))",fontsize=16,color="burlywood",shape="box"];18293[label="wy3/Char wy30",fontsize=10,color="white",style="solid",shape="box"];23 -> 18293[label="",style="solid", color="burlywood", weight=9];
18293 -> 25[label="",style="solid", color="burlywood", weight=3];
24[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy5) (Pos Zero) (primCharToInt wy3) (not (primCmpInt (Pos Zero) (primCharToInt wy3) == LT))) (primCharToInt wy3) (iterate (Pos Zero - primCharToInt wy3 +) (Pos Zero - primCharToInt wy3 + primCharToInt wy3)) (numericEnumFromThenToP1 (fromEnum wy5) (Pos Zero) (primCharToInt wy3) (not (primCmpInt (Pos Zero) (primCharToInt wy3) == LT)) (primCharToInt wy3)))",fontsize=16,color="burlywood",shape="box"];18294[label="wy3/Char wy30",fontsize=10,color="white",style="solid",shape="box"];24 -> 18294[label="",style="solid", color="burlywood", weight=9];
18294 -> 26[label="",style="solid", color="burlywood", weight=3];
25[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy5) (Pos (Succ wy400)) (primCharToInt (Char wy30)) (not (primCmpInt (Pos (Succ wy400)) (primCharToInt (Char wy30)) == LT))) (primCharToInt (Char wy30)) (iterate (Pos (Succ wy400) - primCharToInt (Char wy30) +) (Pos (Succ wy400) - primCharToInt (Char wy30) + primCharToInt (Char wy30))) (numericEnumFromThenToP1 (fromEnum wy5) (Pos (Succ wy400)) (primCharToInt (Char wy30)) (not (primCmpInt (Pos (Succ wy400)) (primCharToInt (Char wy30)) == LT)) (primCharToInt (Char wy30))))",fontsize=16,color="black",shape="box"];25 -> 27[label="",style="solid", color="black", weight=3];
26[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy5) (Pos Zero) (primCharToInt (Char wy30)) (not (primCmpInt (Pos Zero) (primCharToInt (Char wy30)) == LT))) (primCharToInt (Char wy30)) (iterate (Pos Zero - primCharToInt (Char wy30) +) (Pos Zero - primCharToInt (Char wy30) + primCharToInt (Char wy30))) (numericEnumFromThenToP1 (fromEnum wy5) (Pos Zero) (primCharToInt (Char wy30)) (not (primCmpInt (Pos Zero) (primCharToInt (Char wy30)) == LT)) (primCharToInt (Char wy30))))",fontsize=16,color="black",shape="box"];26 -> 28[label="",style="solid", color="black", weight=3];
27[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy5) (Pos (Succ wy400)) (Pos wy30) (not (primCmpInt (Pos (Succ wy400)) (Pos wy30) == LT))) (Pos wy30) (iterate (Pos (Succ wy400) - Pos wy30 +) (Pos (Succ wy400) - Pos wy30 + Pos wy30)) (numericEnumFromThenToP1 (fromEnum wy5) (Pos (Succ wy400)) (Pos wy30) (not (primCmpInt (Pos (Succ wy400)) (Pos wy30) == LT)) (Pos wy30)))",fontsize=16,color="black",shape="box"];27 -> 29[label="",style="solid", color="black", weight=3];
28[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy5) (Pos Zero) (Pos wy30) (not (primCmpInt (Pos Zero) (Pos wy30) == LT))) (Pos wy30) (iterate (Pos Zero - Pos wy30 +) (Pos Zero - Pos wy30 + Pos wy30)) (numericEnumFromThenToP1 (fromEnum wy5) (Pos Zero) (Pos wy30) (not (primCmpInt (Pos Zero) (Pos wy30) == LT)) (Pos wy30)))",fontsize=16,color="burlywood",shape="box"];18295[label="wy30/Succ wy300",fontsize=10,color="white",style="solid",shape="box"];28 -> 18295[label="",style="solid", color="burlywood", weight=9];
18295 -> 30[label="",style="solid", color="burlywood", weight=3];
18296[label="wy30/Zero",fontsize=10,color="white",style="solid",shape="box"];28 -> 18296[label="",style="solid", color="burlywood", weight=9];
18296 -> 31[label="",style="solid", color="burlywood", weight=3];
29[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy5) (Pos (Succ wy400)) (Pos wy30) (not (primCmpNat (Succ wy400) wy30 == LT))) (Pos wy30) (iterate (Pos (Succ wy400) - Pos wy30 +) (Pos (Succ wy400) - Pos wy30 + Pos wy30)) (numericEnumFromThenToP1 (fromEnum wy5) (Pos (Succ wy400)) (Pos wy30) (not (primCmpNat (Succ wy400) wy30 == LT)) (Pos wy30)))",fontsize=16,color="burlywood",shape="box"];18297[label="wy30/Succ wy300",fontsize=10,color="white",style="solid",shape="box"];29 -> 18297[label="",style="solid", color="burlywood", weight=9];
18297 -> 32[label="",style="solid", color="burlywood", weight=3];
18298[label="wy30/Zero",fontsize=10,color="white",style="solid",shape="box"];29 -> 18298[label="",style="solid", color="burlywood", weight=9];
18298 -> 33[label="",style="solid", color="burlywood", weight=3];
30[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy5) (Pos Zero) (Pos (Succ wy300)) (not (primCmpInt (Pos Zero) (Pos (Succ wy300)) == LT))) (Pos (Succ wy300)) (iterate (Pos Zero - Pos (Succ wy300) +) (Pos Zero - Pos (Succ wy300) + Pos (Succ wy300))) (numericEnumFromThenToP1 (fromEnum wy5) (Pos Zero) (Pos (Succ wy300)) (not (primCmpInt (Pos Zero) (Pos (Succ wy300)) == LT)) (Pos (Succ wy300))))",fontsize=16,color="black",shape="box"];30 -> 34[label="",style="solid", color="black", weight=3];
31[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy5) (Pos Zero) (Pos Zero) (not (primCmpInt (Pos Zero) (Pos Zero) == LT))) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (numericEnumFromThenToP1 (fromEnum wy5) (Pos Zero) (Pos Zero) (not (primCmpInt (Pos Zero) (Pos Zero) == LT)) (Pos Zero)))",fontsize=16,color="black",shape="box"];31 -> 35[label="",style="solid", color="black", weight=3];
32[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy5) (Pos (Succ wy400)) (Pos (Succ wy300)) (not (primCmpNat (Succ wy400) (Succ wy300) == LT))) (Pos (Succ wy300)) (iterate (Pos (Succ wy400) - Pos (Succ wy300) +) (Pos (Succ wy400) - Pos (Succ wy300) + Pos (Succ wy300))) (numericEnumFromThenToP1 (fromEnum wy5) (Pos (Succ wy400)) (Pos (Succ wy300)) (not (primCmpNat (Succ wy400) (Succ wy300) == LT)) (Pos (Succ wy300))))",fontsize=16,color="black",shape="box"];32 -> 36[label="",style="solid", color="black", weight=3];
33[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy5) (Pos (Succ wy400)) (Pos Zero) (not (primCmpNat (Succ wy400) Zero == LT))) (Pos Zero) (iterate (Pos (Succ wy400) - Pos Zero +) (Pos (Succ wy400) - Pos Zero + Pos Zero)) (numericEnumFromThenToP1 (fromEnum wy5) (Pos (Succ wy400)) (Pos Zero) (not (primCmpNat (Succ wy400) Zero == LT)) (Pos Zero)))",fontsize=16,color="black",shape="box"];33 -> 37[label="",style="solid", color="black", weight=3];
34[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy5) (Pos Zero) (Pos (Succ wy300)) (not (primCmpNat Zero (Succ wy300) == LT))) (Pos (Succ wy300)) (iterate (Pos Zero - Pos (Succ wy300) +) (Pos Zero - Pos (Succ wy300) + Pos (Succ wy300))) (numericEnumFromThenToP1 (fromEnum wy5) (Pos Zero) (Pos (Succ wy300)) (not (primCmpNat Zero (Succ wy300) == LT)) (Pos (Succ wy300))))",fontsize=16,color="black",shape="box"];34 -> 38[label="",style="solid", color="black", weight=3];
35[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy5) (Pos Zero) (Pos Zero) (not (EQ == LT))) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (numericEnumFromThenToP1 (fromEnum wy5) (Pos Zero) (Pos Zero) (not (EQ == LT)) (Pos Zero)))",fontsize=16,color="black",shape="box"];35 -> 39[label="",style="solid", color="black", weight=3];
36 -> 775[label="",style="dashed", color="red", weight=0];
36[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy5) (Pos (Succ wy400)) (Pos (Succ wy300)) (not (primCmpNat wy400 wy300 == LT))) (Pos (Succ wy300)) (iterate (Pos (Succ wy400) - Pos (Succ wy300) +) (Pos (Succ wy400) - Pos (Succ wy300) + Pos (Succ wy300))) (numericEnumFromThenToP1 (fromEnum wy5) (Pos (Succ wy400)) (Pos (Succ wy300)) (not (primCmpNat wy400 wy300 == LT)) (Pos (Succ wy300))))",fontsize=16,color="magenta"];36 -> 776[label="",style="dashed", color="magenta", weight=3];
36 -> 777[label="",style="dashed", color="magenta", weight=3];
36 -> 778[label="",style="dashed", color="magenta", weight=3];
36 -> 779[label="",style="dashed", color="magenta", weight=3];
36 -> 780[label="",style="dashed", color="magenta", weight=3];
37[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy5) (Pos (Succ wy400)) (Pos Zero) (not (GT == LT))) (Pos Zero) (iterate (Pos (Succ wy400) - Pos Zero +) (Pos (Succ wy400) - Pos Zero + Pos Zero)) (numericEnumFromThenToP1 (fromEnum wy5) (Pos (Succ wy400)) (Pos Zero) (not (GT == LT)) (Pos Zero)))",fontsize=16,color="black",shape="box"];37 -> 42[label="",style="solid", color="black", weight=3];
38[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy5) (Pos Zero) (Pos (Succ wy300)) (not (LT == LT))) (Pos (Succ wy300)) (iterate (Pos Zero - Pos (Succ wy300) +) (Pos Zero - Pos (Succ wy300) + Pos (Succ wy300))) (numericEnumFromThenToP1 (fromEnum wy5) (Pos Zero) (Pos (Succ wy300)) (not (LT == LT)) (Pos (Succ wy300))))",fontsize=16,color="black",shape="box"];38 -> 43[label="",style="solid", color="black", weight=3];
39[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy5) (Pos Zero) (Pos Zero) (not False)) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (numericEnumFromThenToP1 (fromEnum wy5) (Pos Zero) (Pos Zero) (not False) (Pos Zero)))",fontsize=16,color="black",shape="box"];39 -> 44[label="",style="solid", color="black", weight=3];
776[label="wy300",fontsize=16,color="green",shape="box"];777[label="wy5",fontsize=16,color="green",shape="box"];778[label="wy400",fontsize=16,color="green",shape="box"];779[label="wy300",fontsize=16,color="green",shape="box"];780[label="wy400",fontsize=16,color="green",shape="box"];775[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy30) (Pos (Succ wy31)) (Pos (Succ wy32)) (not (primCmpNat wy33 wy34 == LT))) (Pos (Succ wy32)) (iterate (Pos (Succ wy31) - Pos (Succ wy32) +) (Pos (Succ wy31) - Pos (Succ wy32) + Pos (Succ wy32))) (numericEnumFromThenToP1 (fromEnum wy30) (Pos (Succ wy31)) (Pos (Succ wy32)) (not (primCmpNat wy33 wy34 == LT)) (Pos (Succ wy32))))\n  Enum a  Enum b",fontsize=16,color="burlywood",shape="triangle"];18300[label="wy33/Succ wy330",fontsize=10,color="white",style="solid",shape="box"];775 -> 18300[label="",style="solid", color="burlywood", weight=9];
18300 -> 826[label="",style="solid", color="burlywood", weight=3];
18301[label="wy33/Zero",fontsize=10,color="white",style="solid",shape="box"];775 -> 18301[label="",style="solid", color="burlywood", weight=9];
18301 -> 827[label="",style="solid", color="burlywood", weight=3];
42[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy5) (Pos (Succ wy400)) (Pos Zero) (not False)) (Pos Zero) (iterate (Pos (Succ wy400) - Pos Zero +) (Pos (Succ wy400) - Pos Zero + Pos Zero)) (numericEnumFromThenToP1 (fromEnum wy5) (Pos (Succ wy400)) (Pos Zero) (not False) (Pos Zero)))",fontsize=16,color="black",shape="box"];42 -> 49[label="",style="solid", color="black", weight=3];
43[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy5) (Pos Zero) (Pos (Succ wy300)) (not True)) (Pos (Succ wy300)) (iterate (Pos Zero - Pos (Succ wy300) +) (Pos Zero - Pos (Succ wy300) + Pos (Succ wy300))) (numericEnumFromThenToP1 (fromEnum wy5) (Pos Zero) (Pos (Succ wy300)) (not True) (Pos (Succ wy300))))",fontsize=16,color="black",shape="box"];43 -> 50[label="",style="solid", color="black", weight=3];
44[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy5) (Pos Zero) (Pos Zero) True) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (numericEnumFromThenToP1 (fromEnum wy5) (Pos Zero) (Pos Zero) True (Pos Zero)))",fontsize=16,color="black",shape="box"];44 -> 51[label="",style="solid", color="black", weight=3];
826[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy30) (Pos (Succ wy31)) (Pos (Succ wy32)) (not (primCmpNat (Succ wy330) wy34 == LT))) (Pos (Succ wy32)) (iterate (Pos (Succ wy31) - Pos (Succ wy32) +) (Pos (Succ wy31) - Pos (Succ wy32) + Pos (Succ wy32))) (numericEnumFromThenToP1 (fromEnum wy30) (Pos (Succ wy31)) (Pos (Succ wy32)) (not (primCmpNat (Succ wy330) wy34 == LT)) (Pos (Succ wy32))))\n  Enum a  Enum b",fontsize=16,color="burlywood",shape="box"];18302[label="wy34/Succ wy340",fontsize=10,color="white",style="solid",shape="box"];826 -> 18302[label="",style="solid", color="burlywood", weight=9];
18302 -> 847[label="",style="solid", color="burlywood", weight=3];
18303[label="wy34/Zero",fontsize=10,color="white",style="solid",shape="box"];826 -> 18303[label="",style="solid", color="burlywood", weight=9];
18303 -> 848[label="",style="solid", color="burlywood", weight=3];
827[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy30) (Pos (Succ wy31)) (Pos (Succ wy32)) (not (primCmpNat Zero wy34 == LT))) (Pos (Succ wy32)) (iterate (Pos (Succ wy31) - Pos (Succ wy32) +) (Pos (Succ wy31) - Pos (Succ wy32) + Pos (Succ wy32))) (numericEnumFromThenToP1 (fromEnum wy30) (Pos (Succ wy31)) (Pos (Succ wy32)) (not (primCmpNat Zero wy34 == LT)) (Pos (Succ wy32))))\n  Enum a  Enum b",fontsize=16,color="burlywood",shape="box"];18304[label="wy34/Succ wy340",fontsize=10,color="white",style="solid",shape="box"];827 -> 18304[label="",style="solid", color="burlywood", weight=9];
18304 -> 849[label="",style="solid", color="burlywood", weight=3];
18305[label="wy34/Zero",fontsize=10,color="white",style="solid",shape="box"];827 -> 18305[label="",style="solid", color="burlywood", weight=9];
18305 -> 850[label="",style="solid", color="burlywood", weight=3];
49[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy5) (Pos (Succ wy400)) (Pos Zero) True) (Pos Zero) (iterate (Pos (Succ wy400) - Pos Zero +) (Pos (Succ wy400) - Pos Zero + Pos Zero)) (numericEnumFromThenToP1 (fromEnum wy5) (Pos (Succ wy400)) (Pos Zero) True (Pos Zero)))",fontsize=16,color="black",shape="box"];49 -> 56[label="",style="solid", color="black", weight=3];
50[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy5) (Pos Zero) (Pos (Succ wy300)) False) (Pos (Succ wy300)) (iterate (Pos Zero - Pos (Succ wy300) +) (Pos Zero - Pos (Succ wy300) + Pos (Succ wy300))) (numericEnumFromThenToP1 (fromEnum wy5) (Pos Zero) (Pos (Succ wy300)) False (Pos (Succ wy300))))",fontsize=16,color="black",shape="box"];50 -> 57[label="",style="solid", color="black", weight=3];
51[label="map toEnum (takeWhile1 (flip (<=) (fromEnum wy5)) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (flip (<=) (fromEnum wy5) (Pos Zero)))",fontsize=16,color="black",shape="box"];51 -> 58[label="",style="solid", color="black", weight=3];
847[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy30) (Pos (Succ wy31)) (Pos (Succ wy32)) (not (primCmpNat (Succ wy330) (Succ wy340) == LT))) (Pos (Succ wy32)) (iterate (Pos (Succ wy31) - Pos (Succ wy32) +) (Pos (Succ wy31) - Pos (Succ wy32) + Pos (Succ wy32))) (numericEnumFromThenToP1 (fromEnum wy30) (Pos (Succ wy31)) (Pos (Succ wy32)) (not (primCmpNat (Succ wy330) (Succ wy340) == LT)) (Pos (Succ wy32))))\n  Enum a  Enum b",fontsize=16,color="black",shape="box"];847 -> 869[label="",style="solid", color="black", weight=3];
848[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy30) (Pos (Succ wy31)) (Pos (Succ wy32)) (not (primCmpNat (Succ wy330) Zero == LT))) (Pos (Succ wy32)) (iterate (Pos (Succ wy31) - Pos (Succ wy32) +) (Pos (Succ wy31) - Pos (Succ wy32) + Pos (Succ wy32))) (numericEnumFromThenToP1 (fromEnum wy30) (Pos (Succ wy31)) (Pos (Succ wy32)) (not (primCmpNat (Succ wy330) Zero == LT)) (Pos (Succ wy32))))\n  Enum a  Enum b",fontsize=16,color="black",shape="box"];848 -> 870[label="",style="solid", color="black", weight=3];
849[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy30) (Pos (Succ wy31)) (Pos (Succ wy32)) (not (primCmpNat Zero (Succ wy340) == LT))) (Pos (Succ wy32)) (iterate (Pos (Succ wy31) - Pos (Succ wy32) +) (Pos (Succ wy31) - Pos (Succ wy32) + Pos (Succ wy32))) (numericEnumFromThenToP1 (fromEnum wy30) (Pos (Succ wy31)) (Pos (Succ wy32)) (not (primCmpNat Zero (Succ wy340) == LT)) (Pos (Succ wy32))))\n  Enum a  Enum b",fontsize=16,color="black",shape="box"];849 -> 871[label="",style="solid", color="black", weight=3];
850[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy30) (Pos (Succ wy31)) (Pos (Succ wy32)) (not (primCmpNat Zero Zero == LT))) (Pos (Succ wy32)) (iterate (Pos (Succ wy31) - Pos (Succ wy32) +) (Pos (Succ wy31) - Pos (Succ wy32) + Pos (Succ wy32))) (numericEnumFromThenToP1 (fromEnum wy30) (Pos (Succ wy31)) (Pos (Succ wy32)) (not (primCmpNat Zero Zero == LT)) (Pos (Succ wy32))))\n  Enum a  Enum b",fontsize=16,color="black",shape="box"];850 -> 872[label="",style="solid", color="black", weight=3];
56[label="map toEnum (takeWhile1 (flip (<=) (fromEnum wy5)) (Pos Zero) (iterate (Pos (Succ wy400) - Pos Zero +) (Pos (Succ wy400) - Pos Zero + Pos Zero)) (flip (<=) (fromEnum wy5) (Pos Zero)))",fontsize=16,color="black",shape="box"];56 -> 64[label="",style="solid", color="black", weight=3];
57[label="map toEnum (takeWhile1 (numericEnumFromThenToP0 (fromEnum wy5) (Pos Zero) (Pos (Succ wy300)) otherwise) (Pos (Succ wy300)) (iterate (Pos Zero - Pos (Succ wy300) +) (Pos Zero - Pos (Succ wy300) + Pos (Succ wy300))) (numericEnumFromThenToP0 (fromEnum wy5) (Pos Zero) (Pos (Succ wy300)) otherwise (Pos (Succ wy300))))",fontsize=16,color="black",shape="box"];57 -> 65[label="",style="solid", color="black", weight=3];
58[label="map toEnum (takeWhile1 (flip (<=) (fromEnum wy5)) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) ((<=) Pos Zero fromEnum wy5))",fontsize=16,color="black",shape="box"];58 -> 66[label="",style="solid", color="black", weight=3];
869 -> 775[label="",style="dashed", color="red", weight=0];
869[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy30) (Pos (Succ wy31)) (Pos (Succ wy32)) (not (primCmpNat wy330 wy340 == LT))) (Pos (Succ wy32)) (iterate (Pos (Succ wy31) - Pos (Succ wy32) +) (Pos (Succ wy31) - Pos (Succ wy32) + Pos (Succ wy32))) (numericEnumFromThenToP1 (fromEnum wy30) (Pos (Succ wy31)) (Pos (Succ wy32)) (not (primCmpNat wy330 wy340 == LT)) (Pos (Succ wy32))))\n  Enum a  Enum b",fontsize=16,color="magenta"];869 -> 890[label="",style="dashed", color="magenta", weight=3];
869 -> 891[label="",style="dashed", color="magenta", weight=3];
870[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy30) (Pos (Succ wy31)) (Pos (Succ wy32)) (not (GT == LT))) (Pos (Succ wy32)) (iterate (Pos (Succ wy31) - Pos (Succ wy32) +) (Pos (Succ wy31) - Pos (Succ wy32) + Pos (Succ wy32))) (numericEnumFromThenToP1 (fromEnum wy30) (Pos (Succ wy31)) (Pos (Succ wy32)) (not (GT == LT)) (Pos (Succ wy32))))\n  Enum a  Enum b",fontsize=16,color="black",shape="box"];870 -> 892[label="",style="solid", color="black", weight=3];
871[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy30) (Pos (Succ wy31)) (Pos (Succ wy32)) (not (LT == LT))) (Pos (Succ wy32)) (iterate (Pos (Succ wy31) - Pos (Succ wy32) +) (Pos (Succ wy31) - Pos (Succ wy32) + Pos (Succ wy32))) (numericEnumFromThenToP1 (fromEnum wy30) (Pos (Succ wy31)) (Pos (Succ wy32)) (not (LT == LT)) (Pos (Succ wy32))))\n  Enum a  Enum b",fontsize=16,color="black",shape="box"];871 -> 893[label="",style="solid", color="black", weight=3];
872[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy30) (Pos (Succ wy31)) (Pos (Succ wy32)) (not (EQ == LT))) (Pos (Succ wy32)) (iterate (Pos (Succ wy31) - Pos (Succ wy32) +) (Pos (Succ wy31) - Pos (Succ wy32) + Pos (Succ wy32))) (numericEnumFromThenToP1 (fromEnum wy30) (Pos (Succ wy31)) (Pos (Succ wy32)) (not (EQ == LT)) (Pos (Succ wy32))))\n  Enum a  Enum b",fontsize=16,color="black",shape="box"];872 -> 894[label="",style="solid", color="black", weight=3];
64[label="map toEnum (takeWhile1 (flip (<=) (fromEnum wy5)) (Pos Zero) (iterate (Pos (Succ wy400) - Pos Zero +) (Pos (Succ wy400) - Pos Zero + Pos Zero)) ((<=) Pos Zero fromEnum wy5))",fontsize=16,color="black",shape="box"];64 -> 74[label="",style="solid", color="black", weight=3];
65[label="map toEnum (takeWhile1 (numericEnumFromThenToP0 (fromEnum wy5) (Pos Zero) (Pos (Succ wy300)) True) (Pos (Succ wy300)) (iterate (Pos Zero - Pos (Succ wy300) +) (Pos Zero - Pos (Succ wy300) + Pos (Succ wy300))) (numericEnumFromThenToP0 (fromEnum wy5) (Pos Zero) (Pos (Succ wy300)) True (Pos (Succ wy300))))",fontsize=16,color="black",shape="box"];65 -> 75[label="",style="solid", color="black", weight=3];
66[label="map toEnum (takeWhile1 (flip (<=) (fromEnum wy5)) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (compare (Pos Zero) (fromEnum wy5) /= GT))",fontsize=16,color="black",shape="box"];66 -> 76[label="",style="solid", color="black", weight=3];
890[label="wy340",fontsize=16,color="green",shape="box"];891[label="wy330",fontsize=16,color="green",shape="box"];892[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy30) (Pos (Succ wy31)) (Pos (Succ wy32)) (not False)) (Pos (Succ wy32)) (iterate (Pos (Succ wy31) - Pos (Succ wy32) +) (Pos (Succ wy31) - Pos (Succ wy32) + Pos (Succ wy32))) (numericEnumFromThenToP1 (fromEnum wy30) (Pos (Succ wy31)) (Pos (Succ wy32)) (not False) (Pos (Succ wy32))))\n  Enum a  Enum b",fontsize=16,color="black",shape="triangle"];892 -> 916[label="",style="solid", color="black", weight=3];
893[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy30) (Pos (Succ wy31)) (Pos (Succ wy32)) (not True)) (Pos (Succ wy32)) (iterate (Pos (Succ wy31) - Pos (Succ wy32) +) (Pos (Succ wy31) - Pos (Succ wy32) + Pos (Succ wy32))) (numericEnumFromThenToP1 (fromEnum wy30) (Pos (Succ wy31)) (Pos (Succ wy32)) (not True) (Pos (Succ wy32))))\n  Enum a  Enum b",fontsize=16,color="black",shape="box"];893 -> 917[label="",style="solid", color="black", weight=3];
894 -> 892[label="",style="dashed", color="red", weight=0];
894[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy30) (Pos (Succ wy31)) (Pos (Succ wy32)) (not False)) (Pos (Succ wy32)) (iterate (Pos (Succ wy31) - Pos (Succ wy32) +) (Pos (Succ wy31) - Pos (Succ wy32) + Pos (Succ wy32))) (numericEnumFromThenToP1 (fromEnum wy30) (Pos (Succ wy31)) (Pos (Succ wy32)) (not False) (Pos (Succ wy32))))\n  Enum a  Enum b",fontsize=16,color="magenta"];74[label="map toEnum (takeWhile1 (flip (<=) (fromEnum wy5)) (Pos Zero) (iterate (Pos (Succ wy400) - Pos Zero +) (Pos (Succ wy400) - Pos Zero + Pos Zero)) (compare (Pos Zero) (fromEnum wy5) /= GT))",fontsize=16,color="black",shape="box"];74 -> 84[label="",style="solid", color="black", weight=3];
75[label="map toEnum (takeWhile1 (flip (>=) (fromEnum wy5)) (Pos (Succ wy300)) (iterate (Pos Zero - Pos (Succ wy300) +) (Pos Zero - Pos (Succ wy300) + Pos (Succ wy300))) (flip (>=) (fromEnum wy5) (Pos (Succ wy300))))",fontsize=16,color="black",shape="box"];75 -> 85[label="",style="solid", color="black", weight=3];
76[label="map toEnum (takeWhile1 (flip (<=) (fromEnum wy5)) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (not (compare (Pos Zero) (fromEnum wy5) == GT)))",fontsize=16,color="black",shape="box"];76 -> 86[label="",style="solid", color="black", weight=3];
916[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy30) (Pos (Succ wy31)) (Pos (Succ wy32)) True) (Pos (Succ wy32)) (iterate (Pos (Succ wy31) - Pos (Succ wy32) +) (Pos (Succ wy31) - Pos (Succ wy32) + Pos (Succ wy32))) (numericEnumFromThenToP1 (fromEnum wy30) (Pos (Succ wy31)) (Pos (Succ wy32)) True (Pos (Succ wy32))))\n  Enum a  Enum b",fontsize=16,color="black",shape="box"];916 -> 938[label="",style="solid", color="black", weight=3];
917[label="map toEnum (takeWhile1 (numericEnumFromThenToP1 (fromEnum wy30) (Pos (Succ wy31)) (Pos (Succ wy32)) False) (Pos (Succ wy32)) (iterate (Pos (Succ wy31) - Pos (Succ wy32) +) (Pos (Succ wy31) - Pos (Succ wy32) + Pos (Succ wy32))) (numericEnumFromThenToP1 (fromEnum wy30) (Pos (Succ wy31)) (Pos (Succ wy32)) False (Pos (Succ wy32))))\n  Enum a  Enum b",fontsize=16,color="black",shape="box"];917 -> 939[label="",style="solid", color="black", weight=3];
84[label="map toEnum (takeWhile1 (flip (<=) (fromEnum wy5)) (Pos Zero) (iterate (Pos (Succ wy400) - Pos Zero +) (Pos (Succ wy400) - Pos Zero + Pos Zero)) (not (compare (Pos Zero) (fromEnum wy5) == GT)))",fontsize=16,color="black",shape="box"];84 -> 95[label="",style="solid", color="black", weight=3];
85[label="map toEnum (takeWhile1 (flip (>=) (fromEnum wy5)) (Pos (Succ wy300)) (iterate (Pos Zero - Pos (Succ wy300) +) (Pos Zero - Pos (Succ wy300) + Pos (Succ wy300))) ((>=) Pos (Succ wy300) fromEnum wy5))",fontsize=16,color="black",shape="box"];85 -> 96[label="",style="solid", color="black", weight=3];
86[label="map toEnum (takeWhile1 (flip (<=) (fromEnum wy5)) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (fromEnum wy5) == GT)))",fontsize=16,color="black",shape="box"];86 -> 97[label="",style="solid", color="black", weight=3];
938[label="map toEnum (takeWhile1 (flip (<=) (fromEnum wy30)) (Pos (Succ wy32)) (iterate (Pos (Succ wy31) - Pos (Succ wy32) +) (Pos (Succ wy31) - Pos (Succ wy32) + Pos (Succ wy32))) (flip (<=) (fromEnum wy30) (Pos (Succ wy32))))\n  Enum a  Enum b",fontsize=16,color="black",shape="box"];938 -> 959[label="",style="solid", color="black", weight=3];
939[label="map toEnum (takeWhile1 (numericEnumFromThenToP0 (fromEnum wy30) (Pos (Succ wy31)) (Pos (Succ wy32)) otherwise) (Pos (Succ wy32)) (iterate (Pos (Succ wy31) - Pos (Succ wy32) +) (Pos (Succ wy31) - Pos (Succ wy32) + Pos (Succ wy32))) (numericEnumFromThenToP0 (fromEnum wy30) (Pos (Succ wy31)) (Pos (Succ wy32)) otherwise (Pos (Succ wy32))))\n  Enum a  Enum b",fontsize=16,color="black",shape="box"];939 -> 960[label="",style="solid", color="black", weight=3];
95[label="map toEnum (takeWhile1 (flip (<=) (fromEnum wy5)) (Pos Zero) (iterate (Pos (Succ wy400) - Pos Zero +) (Pos (Succ wy400) - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (fromEnum wy5) == GT)))",fontsize=16,color="black",shape="box"];95 -> 108[label="",style="solid", color="black", weight=3];
96[label="map toEnum (takeWhile1 (flip (>=) (fromEnum wy5)) (Pos (Succ wy300)) (iterate (Pos Zero - Pos (Succ wy300) +) (Pos Zero - Pos (Succ wy300) + Pos (Succ wy300))) (compare (Pos (Succ wy300)) (fromEnum wy5) /= LT))",fontsize=16,color="black",shape="box"];96 -> 109[label="",style="solid", color="black", weight=3];
97[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt wy5)) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (primCharToInt wy5) == GT)))",fontsize=16,color="burlywood",shape="box"];18308[label="wy5/Char wy50",fontsize=10,color="white",style="solid",shape="box"];97 -> 18308[label="",style="solid", color="burlywood", weight=9];
18308 -> 110[label="",style="solid", color="burlywood", weight=3];
959[label="map toEnum (takeWhile1 (flip (<=) (fromEnum wy30)) (Pos (Succ wy32)) (iterate (Pos (Succ wy31) - Pos (Succ wy32) +) (Pos (Succ wy31) - Pos (Succ wy32) + Pos (Succ wy32))) ((<=) Pos (Succ wy32) fromEnum wy30))\n  Enum a  Enum b",fontsize=16,color="black",shape="box"];959 -> 984[label="",style="solid", color="black", weight=3];
960[label="map toEnum (takeWhile1 (numericEnumFromThenToP0 (fromEnum wy30) (Pos (Succ wy31)) (Pos (Succ wy32)) True) (Pos (Succ wy32)) (iterate (Pos (Succ wy31) - Pos (Succ wy32) +) (Pos (Succ wy31) - Pos (Succ wy32) + Pos (Succ wy32))) (numericEnumFromThenToP0 (fromEnum wy30) (Pos (Succ wy31)) (Pos (Succ wy32)) True (Pos (Succ wy32))))\n  Enum a  Enum b",fontsize=16,color="black",shape="box"];960 -> 985[label="",style="solid", color="black", weight=3];
108[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt wy5)) (Pos Zero) (iterate (Pos (Succ wy400) - Pos Zero +) (Pos (Succ wy400) - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (primCharToInt wy5) == GT)))",fontsize=16,color="burlywood",shape="box"];18309[label="wy5/Char wy50",fontsize=10,color="white",style="solid",shape="box"];108 -> 18309[label="",style="solid", color="burlywood", weight=9];
18309 -> 121[label="",style="solid", color="burlywood", weight=3];
109[label="map toEnum (takeWhile1 (flip (>=) (fromEnum wy5)) (Pos (Succ wy300)) (iterate (Pos Zero - Pos (Succ wy300) +) (Pos Zero - Pos (Succ wy300) + Pos (Succ wy300))) (not (compare (Pos (Succ wy300)) (fromEnum wy5) == LT)))",fontsize=16,color="black",shape="box"];109 -> 122[label="",style="solid", color="black", weight=3];
110[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt (Char wy50))) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (primCharToInt (Char wy50)) == GT)))",fontsize=16,color="black",shape="box"];110 -> 123[label="",style="solid", color="black", weight=3];
984[label="map toEnum (takeWhile1 (flip (<=) (fromEnum wy30)) (Pos (Succ wy32)) (iterate (Pos (Succ wy31) - Pos (Succ wy32) +) (Pos (Succ wy31) - Pos (Succ wy32) + Pos (Succ wy32))) (compare (Pos (Succ wy32)) (fromEnum wy30) /= GT))\n  Enum a  Enum b",fontsize=16,color="black",shape="box"];984 -> 1008[label="",style="solid", color="black", weight=3];
985[label="map toEnum (takeWhile1 (flip (>=) (fromEnum wy30)) (Pos (Succ wy32)) (iterate (Pos (Succ wy31) - Pos (Succ wy32) +) (Pos (Succ wy31) - Pos (Succ wy32) + Pos (Succ wy32))) (flip (>=) (fromEnum wy30) (Pos (Succ wy32))))\n  Enum a  Enum b",fontsize=16,color="black",shape="box"];985 -> 1009[label="",style="solid", color="black", weight=3];
121[label="map toEnum (takeWhile1 (flip (<=) (primCharToInt (Char wy50))) (Pos Zero) (iterate (Pos (Succ wy400) - Pos Zero +) (Pos (Succ wy400) - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (primCharToInt (Char wy50)) == GT)))",fontsize=16,color="black",shape="box"];121 -> 135[label="",style="solid", color="black", weight=3];
122[label="map toEnum (takeWhile1 (flip (>=) (fromEnum wy5)) (Pos (Succ wy300)) (iterate (Pos Zero - Pos (Succ wy300) +) (Pos Zero - Pos (Succ wy300) + Pos (Succ wy300))) (not (primCmpInt (Pos (Succ wy300)) (fromEnum wy5) == LT)))",fontsize=16,color="black",shape="box"];122 -> 136[label="",style="solid", color="black", weight=3];
123[label="map toEnum (takeWhile1 (flip (<=) (Pos wy50)) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (Pos wy50) == GT)))",fontsize=16,color="burlywood",shape="box"];18310[label="wy50/Succ wy500",fontsize=10,color="white",style="solid",shape="box"];123 -> 18310[label="",style="solid", color="burlywood", weight=9];
18310 -> 137[label="",style="solid", color="burlywood", weight=3];
18311[label="wy50/Zero",fontsize=10,color="white",style="solid",shape="box"];123 -> 18311[label="",style="solid", color="burlywood", weight=9];
18311 -> 138[label="",style="solid", color="burlywood", weight=3];
1008[label="map toEnum (takeWhile1 (flip (<=) (fromEnum wy30)) (Pos (Succ wy32)) (iterate (Pos (Succ wy31) - Pos (Succ wy32) +) (Pos (Succ wy31) - Pos (Succ wy32) + Pos (Succ wy32))) (not (compare (Pos (Succ wy32)) (fromEnum wy30) == GT)))\n  Enum a  Enum b",fontsize=16,color="black",shape="box"];1008 -> 1033[label="",style="solid", color="black", weight=3];
1009[label="map toEnum (takeWhile1 (flip (>=) (fromEnum wy30)) (Pos (Succ wy32)) (iterate (Pos (Succ wy31) - Pos (Succ wy32) +) (Pos (Succ wy31) - Pos (Succ wy32) + Pos (Succ wy32))) ((>=) Pos (Succ wy32) fromEnum wy30))\n  Enum a  Enum b",fontsize=16,color="black",shape="box"];1009 -> 1034[label="",style="solid", color="black", weight=3];
135[label="map toEnum (takeWhile1 (flip (<=) (Pos wy50)) (Pos Zero) (iterate (Pos (Succ wy400) - Pos Zero +) (Pos (Succ wy400) - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (Pos wy50) == GT)))",fontsize=16,color="burlywood",shape="box"];18312[label="wy50/Succ wy500",fontsize=10,color="white",style="solid",shape="box"];135 -> 18312[label="",style="solid", color="burlywood", weight=9];
18312 -> 152[label="",style="solid", color="burlywood", weight=3];
18313[label="wy50/Zero",fontsize=10,color="white",style="solid",shape="box"];135 -> 18313[label="",style="solid", color="burlywood", weight=9];
18313 -> 153[label="",style="solid", color="burlywood", weight=3];
136[label="map toEnum (takeWhile1 (flip (>=) (primCharToInt wy5)) (Pos (Succ wy300)) (iterate (Pos Zero - Pos (Succ wy300) +) (Pos Zero - Pos (Succ wy300) + Pos (Succ wy300))) (not (primCmpInt (Pos (Succ wy300)) (primCharToInt wy5) == LT)))",fontsize=16,color="burlywood",shape="box"];18314[label="wy5/Char wy50",fontsize=10,color="white",style="solid",shape="box"];136 -> 18314[label="",style="solid", color="burlywood", weight=9];
18314 -> 154[label="",style="solid", color="burlywood", weight=3];
137[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy500))) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (Pos (Succ wy500)) == GT)))",fontsize=16,color="black",shape="box"];137 -> 155[label="",style="solid", color="black", weight=3];
138[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (Pos Zero) == GT)))",fontsize=16,color="black",shape="box"];138 -> 156[label="",style="solid", color="black", weight=3];
1033 -> 1065[label="",style="dashed", color="red", weight=0];
1033[label="map toEnum (takeWhile1 (flip (<=) (fromEnum wy30)) (Pos (Succ wy32)) (iterate (Pos (Succ wy31) - Pos (Succ wy32) +) (Pos (Succ wy31) - Pos (Succ wy32) + Pos (Succ wy32))) (not (primCmpInt (Pos (Succ wy32)) (fromEnum wy30) == GT)))\n  Enum a  Enum b",fontsize=16,color="magenta"];1033 -> 1066[label="",style="dashed", color="magenta", weight=3];
1033 -> 1067[label="",style="dashed", color="magenta", weight=3];
1033 -> 1068[label="",style="dashed", color="magenta", weight=3];
1034[label="map toEnum (takeWhile1 (flip (>=) (fromEnum wy30)) (Pos (Succ wy32)) (iterate (Pos (Succ wy31) - Pos (Succ wy32) +) (Pos (Succ wy31) - Pos (Succ wy32) + Pos (Succ wy32))) (compare (Pos (Succ wy32)) (fromEnum wy30) /= LT))\n  Enum a  Enum b",fontsize=16,color="black",shape="box"];1034 -> 1069[label="",style="solid", color="black", weight=3];
152[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy500))) (Pos Zero) (iterate (Pos (Succ wy400) - Pos Zero +) (Pos (Succ wy400) - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (Pos (Succ wy500)) == GT)))",fontsize=16,color="black",shape="box"];152 -> 170[label="",style="solid", color="black", weight=3];
153[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (Pos Zero) (iterate (Pos (Succ wy400) - Pos Zero +) (Pos (Succ wy400) - Pos Zero + Pos Zero)) (not (primCmpInt (Pos Zero) (Pos Zero) == GT)))",fontsize=16,color="black",shape="box"];153 -> 171[label="",style="solid", color="black", weight=3];
154[label="map toEnum (takeWhile1 (flip (>=) (primCharToInt (Char wy50))) (Pos (Succ wy300)) (iterate (Pos Zero - Pos (Succ wy300) +) (Pos Zero - Pos (Succ wy300) + Pos (Succ wy300))) (not (primCmpInt (Pos (Succ wy300)) (primCharToInt (Char wy50)) == LT)))",fontsize=16,color="black",shape="box"];154 -> 172[label="",style="solid", color="black", weight=3];
155[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy500))) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (not (primCmpNat Zero (Succ wy500) == GT)))",fontsize=16,color="black",shape="box"];155 -> 173[label="",style="solid", color="black", weight=3];
156[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (not (EQ == GT)))",fontsize=16,color="black",shape="box"];156 -> 174[label="",style="solid", color="black", weight=3];
1066[label="wy32",fontsize=16,color="green",shape="box"];1067[label="fromEnum wy30\n  Enum a",fontsize=16,color="blue",shape="box"];18316[label="fromEnum :: () -> Int",fontsize=10,color="white",style="solid",shape="box"];1067 -> 18316[label="",style="solid", color="blue", weight=9];
18316 -> 1070[label="",style="solid", color="blue", weight=3];
18317[label="fromEnum :: (Ratio a) -> Int",fontsize=10,color="white",style="solid",shape="box"];1067 -> 18317[label="",style="solid", color="blue", weight=9];
18317 -> 1071[label="",style="solid", color="blue", weight=3];
18318[label="fromEnum :: Float -> Int",fontsize=10,color="white",style="solid",shape="box"];1067 -> 18318[label="",style="solid", color="blue", weight=9];
18318 -> 1072[label="",style="solid", color="blue", weight=3];
18319[label="fromEnum :: Ordering -> Int",fontsize=10,color="white",style="solid",shape="box"];1067 -> 18319[label="",style="solid", color="blue", weight=9];
18319 -> 1073[label="",style="solid", color="blue", weight=3];
18320[label="fromEnum :: Integer -> Int",fontsize=10,color="white",style="solid",shape="box"];1067 -> 18320[label="",style="solid", color="blue", weight=9];
18320 -> 1074[label="",style="solid", color="blue", weight=3];
18321[label="fromEnum :: Bool -> Int",fontsize=10,color="white",style="solid",shape="box"];1067 -> 18321[label="",style="solid", color="blue", weight=9];
18321 -> 1075[label="",style="solid", color="blue", weight=3];
18322[label="fromEnum :: Char -> Int",fontsize=10,color="white",style="solid",shape="box"];1067 -> 18322[label="",style="solid", color="blue", weight=9];
18322 -> 1076[label="",style="solid", color="blue", weight=3];
18323[label="fromEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];1067 -> 18323[label="",style="solid", color="blue", weight=9];
18323 -> 1077[label="",style="solid", color="blue", weight=3];
18324[label="fromEnum :: Double -> Int",fontsize=10,color="white",style="solid",shape="box"];1067 -> 18324[label="",style="solid", color="blue", weight=9];
18324 -> 1078[label="",style="solid", color="blue", weight=3];
1068[label="wy31",fontsize=16,color="green",shape="box"];1065[label="map toEnum (takeWhile1 (flip (<=) wy39) (Pos (Succ wy40)) (iterate (Pos (Succ wy41) - Pos (Succ wy40) +) (Pos (Succ wy41) - Pos (Succ wy40) + Pos (Succ wy40))) (not (primCmpInt (Pos (Succ wy40)) wy39 == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];18325[label="wy39/Pos wy390",fontsize=10,color="white",style="solid",shape="box"];1065 -> 18325[label="",style="solid", color="burlywood", weight=9];
18325 -> 1079[label="",style="solid", color="burlywood", weight=3];
18326[label="wy39/Neg wy390",fontsize=10,color="white",style="solid",shape="box"];1065 -> 18326[label="",style="solid", color="burlywood", weight=9];
18326 -> 1080[label="",style="solid", color="burlywood", weight=3];
1069[label="map toEnum (takeWhile1 (flip (>=) (fromEnum wy30)) (Pos (Succ wy32)) (iterate (Pos (Succ wy31) - Pos (Succ wy32) +) (Pos (Succ wy31) - Pos (Succ wy32) + Pos (Succ wy32))) (not (compare (Pos (Succ wy32)) (fromEnum wy30) == LT)))\n  Enum a  Enum b",fontsize=16,color="black",shape="box"];1069 -> 1111[label="",style="solid", color="black", weight=3];
170[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy500))) (Pos Zero) (iterate (Pos (Succ wy400) - Pos Zero +) (Pos (Succ wy400) - Pos Zero + Pos Zero)) (not (primCmpNat Zero (Succ wy500) == GT)))",fontsize=16,color="black",shape="box"];170 -> 189[label="",style="solid", color="black", weight=3];
171[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (Pos Zero) (iterate (Pos (Succ wy400) - Pos Zero +) (Pos (Succ wy400) - Pos Zero + Pos Zero)) (not (EQ == GT)))",fontsize=16,color="black",shape="box"];171 -> 190[label="",style="solid", color="black", weight=3];
172[label="map toEnum (takeWhile1 (flip (>=) (Pos wy50)) (Pos (Succ wy300)) (iterate (Pos Zero - Pos (Succ wy300) +) (Pos Zero - Pos (Succ wy300) + Pos (Succ wy300))) (not (primCmpInt (Pos (Succ wy300)) (Pos wy50) == LT)))",fontsize=16,color="black",shape="box"];172 -> 191[label="",style="solid", color="black", weight=3];
173[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy500))) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (not (LT == GT)))",fontsize=16,color="black",shape="box"];173 -> 192[label="",style="solid", color="black", weight=3];
174[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (not False))",fontsize=16,color="black",shape="box"];174 -> 193[label="",style="solid", color="black", weight=3];
1070[label="fromEnum wy30",fontsize=16,color="black",shape="triangle"];1070 -> 1112[label="",style="solid", color="black", weight=3];
1071[label="fromEnum wy30\n  Integral a",fontsize=16,color="black",shape="triangle"];1071 -> 1113[label="",style="solid", color="black", weight=3];
1072[label="fromEnum wy30",fontsize=16,color="black",shape="triangle"];1072 -> 1114[label="",style="solid", color="black", weight=3];
1073[label="fromEnum wy30",fontsize=16,color="black",shape="triangle"];1073 -> 1115[label="",style="solid", color="black", weight=3];
1074[label="fromEnum wy30",fontsize=16,color="black",shape="triangle"];1074 -> 1116[label="",style="solid", color="black", weight=3];
1075[label="fromEnum wy30",fontsize=16,color="black",shape="triangle"];1075 -> 1117[label="",style="solid", color="black", weight=3];
1076[label="fromEnum wy30",fontsize=16,color="black",shape="triangle"];1076 -> 1118[label="",style="solid", color="black", weight=3];
1077[label="fromEnum wy30",fontsize=16,color="black",shape="triangle"];1077 -> 1119[label="",style="solid", color="black", weight=3];
1078[label="fromEnum wy30",fontsize=16,color="black",shape="triangle"];1078 -> 1120[label="",style="solid", color="black", weight=3];
1079[label="map toEnum (takeWhile1 (flip (<=) (Pos wy390)) (Pos (Succ wy40)) (iterate (Pos (Succ wy41) - Pos (Succ wy40) +) (Pos (Succ wy41) - Pos (Succ wy40) + Pos (Succ wy40))) (not (primCmpInt (Pos (Succ wy40)) (Pos wy390) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];1079 -> 1121[label="",style="solid", color="black", weight=3];
1080[label="map toEnum (takeWhile1 (flip (<=) (Neg wy390)) (Pos (Succ wy40)) (iterate (Pos (Succ wy41) - Pos (Succ wy40) +) (Pos (Succ wy41) - Pos (Succ wy40) + Pos (Succ wy40))) (not (primCmpInt (Pos (Succ wy40)) (Neg wy390) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];1080 -> 1122[label="",style="solid", color="black", weight=3];
1111 -> 1153[label="",style="dashed", color="red", weight=0];
1111[label="map toEnum (takeWhile1 (flip (>=) (fromEnum wy30)) (Pos (Succ wy32)) (iterate (Pos (Succ wy31) - Pos (Succ wy32) +) (Pos (Succ wy31) - Pos (Succ wy32) + Pos (Succ wy32))) (not (primCmpInt (Pos (Succ wy32)) (fromEnum wy30) == LT)))\n  Enum a  Enum b",fontsize=16,color="magenta"];1111 -> 1154[label="",style="dashed", color="magenta", weight=3];
1111 -> 1155[label="",style="dashed", color="magenta", weight=3];
1111 -> 1156[label="",style="dashed", color="magenta", weight=3];
189[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy500))) (Pos Zero) (iterate (Pos (Succ wy400) - Pos Zero +) (Pos (Succ wy400) - Pos Zero + Pos Zero)) (not (LT == GT)))",fontsize=16,color="black",shape="box"];189 -> 210[label="",style="solid", color="black", weight=3];
190[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (Pos Zero) (iterate (Pos (Succ wy400) - Pos Zero +) (Pos (Succ wy400) - Pos Zero + Pos Zero)) (not False))",fontsize=16,color="black",shape="box"];190 -> 211[label="",style="solid", color="black", weight=3];
191[label="map toEnum (takeWhile1 (flip (>=) (Pos wy50)) (Pos (Succ wy300)) (iterate (Pos Zero - Pos (Succ wy300) +) (Pos Zero - Pos (Succ wy300) + Pos (Succ wy300))) (not (primCmpNat (Succ wy300) wy50 == LT)))",fontsize=16,color="burlywood",shape="box"];18328[label="wy50/Succ wy500",fontsize=10,color="white",style="solid",shape="box"];191 -> 18328[label="",style="solid", color="burlywood", weight=9];
18328 -> 212[label="",style="solid", color="burlywood", weight=3];
18329[label="wy50/Zero",fontsize=10,color="white",style="solid",shape="box"];191 -> 18329[label="",style="solid", color="burlywood", weight=9];
18329 -> 213[label="",style="solid", color="burlywood", weight=3];
192[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy500))) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) (not False))",fontsize=16,color="black",shape="box"];192 -> 214[label="",style="solid", color="black", weight=3];
193[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) True)",fontsize=16,color="black",shape="box"];193 -> 215[label="",style="solid", color="black", weight=3];
1112[label="error []",fontsize=16,color="red",shape="box"];1113[label="error []",fontsize=16,color="red",shape="box"];1114[label="error []",fontsize=16,color="red",shape="box"];1115[label="error []",fontsize=16,color="red",shape="box"];1116[label="error []",fontsize=16,color="red",shape="box"];1117[label="error []",fontsize=16,color="red",shape="box"];1118[label="primCharToInt wy30",fontsize=16,color="burlywood",shape="box"];18330[label="wy30/Char wy300",fontsize=10,color="white",style="solid",shape="box"];1118 -> 18330[label="",style="solid", color="burlywood", weight=9];
18330 -> 1157[label="",style="solid", color="burlywood", weight=3];
1119[label="error []",fontsize=16,color="red",shape="box"];1120[label="error []",fontsize=16,color="red",shape="box"];1121[label="map toEnum (takeWhile1 (flip (<=) (Pos wy390)) (Pos (Succ wy40)) (iterate (Pos (Succ wy41) - Pos (Succ wy40) +) (Pos (Succ wy41) - Pos (Succ wy40) + Pos (Succ wy40))) (not (primCmpNat (Succ wy40) wy390 == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];18331[label="wy390/Succ wy3900",fontsize=10,color="white",style="solid",shape="box"];1121 -> 18331[label="",style="solid", color="burlywood", weight=9];
18331 -> 1158[label="",style="solid", color="burlywood", weight=3];
18332[label="wy390/Zero",fontsize=10,color="white",style="solid",shape="box"];1121 -> 18332[label="",style="solid", color="burlywood", weight=9];
18332 -> 1159[label="",style="solid", color="burlywood", weight=3];
1122[label="map toEnum (takeWhile1 (flip (<=) (Neg wy390)) (Pos (Succ wy40)) (iterate (Pos (Succ wy41) - Pos (Succ wy40) +) (Pos (Succ wy41) - Pos (Succ wy40) + Pos (Succ wy40))) (not (GT == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];1122 -> 1160[label="",style="solid", color="black", weight=3];
1154[label="fromEnum wy30\n  Enum a",fontsize=16,color="blue",shape="box"];18333[label="fromEnum :: () -> Int",fontsize=10,color="white",style="solid",shape="box"];1154 -> 18333[label="",style="solid", color="blue", weight=9];
18333 -> 1161[label="",style="solid", color="blue", weight=3];
18334[label="fromEnum :: (Ratio a) -> Int",fontsize=10,color="white",style="solid",shape="box"];1154 -> 18334[label="",style="solid", color="blue", weight=9];
18334 -> 1162[label="",style="solid", color="blue", weight=3];
18335[label="fromEnum :: Float -> Int",fontsize=10,color="white",style="solid",shape="box"];1154 -> 18335[label="",style="solid", color="blue", weight=9];
18335 -> 1163[label="",style="solid", color="blue", weight=3];
18336[label="fromEnum :: Ordering -> Int",fontsize=10,color="white",style="solid",shape="box"];1154 -> 18336[label="",style="solid", color="blue", weight=9];
18336 -> 1164[label="",style="solid", color="blue", weight=3];
18337[label="fromEnum :: Integer -> Int",fontsize=10,color="white",style="solid",shape="box"];1154 -> 18337[label="",style="solid", color="blue", weight=9];
18337 -> 1165[label="",style="solid", color="blue", weight=3];
18338[label="fromEnum :: Bool -> Int",fontsize=10,color="white",style="solid",shape="box"];1154 -> 18338[label="",style="solid", color="blue", weight=9];
18338 -> 1166[label="",style="solid", color="blue", weight=3];
18339[label="fromEnum :: Char -> Int",fontsize=10,color="white",style="solid",shape="box"];1154 -> 18339[label="",style="solid", color="blue", weight=9];
18339 -> 1167[label="",style="solid", color="blue", weight=3];
18340[label="fromEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];1154 -> 18340[label="",style="solid", color="blue", weight=9];
18340 -> 1168[label="",style="solid", color="blue", weight=3];
18341[label="fromEnum :: Double -> Int",fontsize=10,color="white",style="solid",shape="box"];1154 -> 18341[label="",style="solid", color="blue", weight=9];
18341 -> 1169[label="",style="solid", color="blue", weight=3];
1155[label="wy32",fontsize=16,color="green",shape="box"];1156[label="wy31",fontsize=16,color="green",shape="box"];1153[label="map toEnum (takeWhile1 (flip (>=) wy46) (Pos (Succ wy47)) (iterate (Pos (Succ wy48) - Pos (Succ wy47) +) (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47))) (not (primCmpInt (Pos (Succ wy47)) wy46 == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];18342[label="wy46/Pos wy460",fontsize=10,color="white",style="solid",shape="box"];1153 -> 18342[label="",style="solid", color="burlywood", weight=9];
18342 -> 1170[label="",style="solid", color="burlywood", weight=3];
18343[label="wy46/Neg wy460",fontsize=10,color="white",style="solid",shape="box"];1153 -> 18343[label="",style="solid", color="burlywood", weight=9];
18343 -> 1171[label="",style="solid", color="burlywood", weight=3];
210[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy500))) (Pos Zero) (iterate (Pos (Succ wy400) - Pos Zero +) (Pos (Succ wy400) - Pos Zero + Pos Zero)) (not False))",fontsize=16,color="black",shape="box"];210 -> 234[label="",style="solid", color="black", weight=3];
211[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (Pos Zero) (iterate (Pos (Succ wy400) - Pos Zero +) (Pos (Succ wy400) - Pos Zero + Pos Zero)) True)",fontsize=16,color="black",shape="box"];211 -> 235[label="",style="solid", color="black", weight=3];
212[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy500))) (Pos (Succ wy300)) (iterate (Pos Zero - Pos (Succ wy300) +) (Pos Zero - Pos (Succ wy300) + Pos (Succ wy300))) (not (primCmpNat (Succ wy300) (Succ wy500) == LT)))",fontsize=16,color="black",shape="box"];212 -> 236[label="",style="solid", color="black", weight=3];
213[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ wy300)) (iterate (Pos Zero - Pos (Succ wy300) +) (Pos Zero - Pos (Succ wy300) + Pos (Succ wy300))) (not (primCmpNat (Succ wy300) Zero == LT)))",fontsize=16,color="black",shape="box"];213 -> 237[label="",style="solid", color="black", weight=3];
214[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy500))) (Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)) True)",fontsize=16,color="black",shape="box"];214 -> 238[label="",style="solid", color="black", weight=3];
215[label="map toEnum (Pos Zero : takeWhile (flip (<=) (Pos Zero)) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)))",fontsize=16,color="black",shape="box"];215 -> 239[label="",style="solid", color="black", weight=3];
1157[label="primCharToInt (Char wy300)",fontsize=16,color="black",shape="box"];1157 -> 1209[label="",style="solid", color="black", weight=3];
1158[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy3900))) (Pos (Succ wy40)) (iterate (Pos (Succ wy41) - Pos (Succ wy40) +) (Pos (Succ wy41) - Pos (Succ wy40) + Pos (Succ wy40))) (not (primCmpNat (Succ wy40) (Succ wy3900) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];1158 -> 1210[label="",style="solid", color="black", weight=3];
1159[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (Pos (Succ wy40)) (iterate (Pos (Succ wy41) - Pos (Succ wy40) +) (Pos (Succ wy41) - Pos (Succ wy40) + Pos (Succ wy40))) (not (primCmpNat (Succ wy40) Zero == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];1159 -> 1211[label="",style="solid", color="black", weight=3];
1160[label="map toEnum (takeWhile1 (flip (<=) (Neg wy390)) (Pos (Succ wy40)) (iterate (Pos (Succ wy41) - Pos (Succ wy40) +) (Pos (Succ wy41) - Pos (Succ wy40) + Pos (Succ wy40))) (not True))\n  Enum a",fontsize=16,color="black",shape="box"];1160 -> 1212[label="",style="solid", color="black", weight=3];
1161 -> 1070[label="",style="dashed", color="red", weight=0];
1161[label="fromEnum wy30",fontsize=16,color="magenta"];1162 -> 1071[label="",style="dashed", color="red", weight=0];
1162[label="fromEnum wy30\n  Integral a",fontsize=16,color="magenta"];1163 -> 1072[label="",style="dashed", color="red", weight=0];
1163[label="fromEnum wy30",fontsize=16,color="magenta"];1164 -> 1073[label="",style="dashed", color="red", weight=0];
1164[label="fromEnum wy30",fontsize=16,color="magenta"];1165 -> 1074[label="",style="dashed", color="red", weight=0];
1165[label="fromEnum wy30",fontsize=16,color="magenta"];1166 -> 1075[label="",style="dashed", color="red", weight=0];
1166[label="fromEnum wy30",fontsize=16,color="magenta"];1167 -> 1076[label="",style="dashed", color="red", weight=0];
1167[label="fromEnum wy30",fontsize=16,color="magenta"];1168 -> 1077[label="",style="dashed", color="red", weight=0];
1168[label="fromEnum wy30",fontsize=16,color="magenta"];1169 -> 1078[label="",style="dashed", color="red", weight=0];
1169[label="fromEnum wy30",fontsize=16,color="magenta"];1170[label="map toEnum (takeWhile1 (flip (>=) (Pos wy460)) (Pos (Succ wy47)) (iterate (Pos (Succ wy48) - Pos (Succ wy47) +) (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47))) (not (primCmpInt (Pos (Succ wy47)) (Pos wy460) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];1170 -> 1213[label="",style="solid", color="black", weight=3];
1171[label="map toEnum (takeWhile1 (flip (>=) (Neg wy460)) (Pos (Succ wy47)) (iterate (Pos (Succ wy48) - Pos (Succ wy47) +) (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47))) (not (primCmpInt (Pos (Succ wy47)) (Neg wy460) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];1171 -> 1214[label="",style="solid", color="black", weight=3];
234[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy500))) (Pos Zero) (iterate (Pos (Succ wy400) - Pos Zero +) (Pos (Succ wy400) - Pos Zero + Pos Zero)) True)",fontsize=16,color="black",shape="box"];234 -> 259[label="",style="solid", color="black", weight=3];
235[label="map toEnum (Pos Zero : takeWhile (flip (<=) (Pos Zero)) (iterate (Pos (Succ wy400) - Pos Zero +) (Pos (Succ wy400) - Pos Zero + Pos Zero)))",fontsize=16,color="black",shape="box"];235 -> 260[label="",style="solid", color="black", weight=3];
236 -> 1359[label="",style="dashed", color="red", weight=0];
236[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy500))) (Pos (Succ wy300)) (iterate (Pos Zero - Pos (Succ wy300) +) (Pos Zero - Pos (Succ wy300) + Pos (Succ wy300))) (not (primCmpNat wy300 wy500 == LT)))",fontsize=16,color="magenta"];236 -> 1360[label="",style="dashed", color="magenta", weight=3];
236 -> 1361[label="",style="dashed", color="magenta", weight=3];
236 -> 1362[label="",style="dashed", color="magenta", weight=3];
236 -> 1363[label="",style="dashed", color="magenta", weight=3];
237[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ wy300)) (iterate (Pos Zero - Pos (Succ wy300) +) (Pos Zero - Pos (Succ wy300) + Pos (Succ wy300))) (not (GT == LT)))",fontsize=16,color="black",shape="box"];237 -> 263[label="",style="solid", color="black", weight=3];
238[label="map toEnum (Pos Zero : takeWhile (flip (<=) (Pos (Succ wy500))) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)))",fontsize=16,color="black",shape="box"];238 -> 264[label="",style="solid", color="black", weight=3];
239[label="toEnum (Pos Zero) : map toEnum (takeWhile (flip (<=) (Pos Zero)) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)))",fontsize=16,color="green",shape="box"];239 -> 265[label="",style="dashed", color="green", weight=3];
239 -> 266[label="",style="dashed", color="green", weight=3];
1209[label="Pos wy300",fontsize=16,color="green",shape="box"];1210 -> 3289[label="",style="dashed", color="red", weight=0];
1210[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy3900))) (Pos (Succ wy40)) (iterate (Pos (Succ wy41) - Pos (Succ wy40) +) (Pos (Succ wy41) - Pos (Succ wy40) + Pos (Succ wy40))) (not (primCmpNat wy40 wy3900 == GT)))\n  Enum a",fontsize=16,color="magenta"];1210 -> 3290[label="",style="dashed", color="magenta", weight=3];
1210 -> 3291[label="",style="dashed", color="magenta", weight=3];
1210 -> 3292[label="",style="dashed", color="magenta", weight=3];
1210 -> 3293[label="",style="dashed", color="magenta", weight=3];
1210 -> 3294[label="",style="dashed", color="magenta", weight=3];
1211[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (Pos (Succ wy40)) (iterate (Pos (Succ wy41) - Pos (Succ wy40) +) (Pos (Succ wy41) - Pos (Succ wy40) + Pos (Succ wy40))) (not (GT == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];1211 -> 1252[label="",style="solid", color="black", weight=3];
1212[label="map toEnum (takeWhile1 (flip (<=) (Neg wy390)) (Pos (Succ wy40)) (iterate (Pos (Succ wy41) - Pos (Succ wy40) +) (Pos (Succ wy41) - Pos (Succ wy40) + Pos (Succ wy40))) False)\n  Enum a",fontsize=16,color="black",shape="box"];1212 -> 1253[label="",style="solid", color="black", weight=3];
1213[label="map toEnum (takeWhile1 (flip (>=) (Pos wy460)) (Pos (Succ wy47)) (iterate (Pos (Succ wy48) - Pos (Succ wy47) +) (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47))) (not (primCmpNat (Succ wy47) wy460 == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];18355[label="wy460/Succ wy4600",fontsize=10,color="white",style="solid",shape="box"];1213 -> 18355[label="",style="solid", color="burlywood", weight=9];
18355 -> 1254[label="",style="solid", color="burlywood", weight=3];
18356[label="wy460/Zero",fontsize=10,color="white",style="solid",shape="box"];1213 -> 18356[label="",style="solid", color="burlywood", weight=9];
18356 -> 1255[label="",style="solid", color="burlywood", weight=3];
1214[label="map toEnum (takeWhile1 (flip (>=) (Neg wy460)) (Pos (Succ wy47)) (iterate (Pos (Succ wy48) - Pos (Succ wy47) +) (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47))) (not (GT == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];1214 -> 1256[label="",style="solid", color="black", weight=3];
259[label="map toEnum (Pos Zero : takeWhile (flip (<=) (Pos (Succ wy500))) (iterate (Pos (Succ wy400) - Pos Zero +) (Pos (Succ wy400) - Pos Zero + Pos Zero)))",fontsize=16,color="black",shape="box"];259 -> 291[label="",style="solid", color="black", weight=3];
260[label="toEnum (Pos Zero) : map toEnum (takeWhile (flip (<=) (Pos Zero)) (iterate (Pos (Succ wy400) - Pos Zero +) (Pos (Succ wy400) - Pos Zero + Pos Zero)))",fontsize=16,color="green",shape="box"];260 -> 292[label="",style="dashed", color="green", weight=3];
260 -> 293[label="",style="dashed", color="green", weight=3];
1360[label="wy500",fontsize=16,color="green",shape="box"];1361[label="wy300",fontsize=16,color="green",shape="box"];1362[label="wy300",fontsize=16,color="green",shape="box"];1363[label="wy500",fontsize=16,color="green",shape="box"];1359[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy60))) (Pos (Succ wy61)) (iterate (Pos Zero - Pos (Succ wy61) +) (Pos Zero - Pos (Succ wy61) + Pos (Succ wy61))) (not (primCmpNat wy62 wy63 == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];18357[label="wy62/Succ wy620",fontsize=10,color="white",style="solid",shape="box"];1359 -> 18357[label="",style="solid", color="burlywood", weight=9];
18357 -> 1400[label="",style="solid", color="burlywood", weight=3];
18358[label="wy62/Zero",fontsize=10,color="white",style="solid",shape="box"];1359 -> 18358[label="",style="solid", color="burlywood", weight=9];
18358 -> 1401[label="",style="solid", color="burlywood", weight=3];
263[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ wy300)) (iterate (Pos Zero - Pos (Succ wy300) +) (Pos Zero - Pos (Succ wy300) + Pos (Succ wy300))) (not False))",fontsize=16,color="black",shape="box"];263 -> 298[label="",style="solid", color="black", weight=3];
264[label="toEnum (Pos Zero) : map toEnum (takeWhile (flip (<=) (Pos (Succ wy500))) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)))",fontsize=16,color="green",shape="box"];264 -> 299[label="",style="dashed", color="green", weight=3];
264 -> 300[label="",style="dashed", color="green", weight=3];
265[label="toEnum (Pos Zero)",fontsize=16,color="black",shape="triangle"];265 -> 301[label="",style="solid", color="black", weight=3];
266[label="map toEnum (takeWhile (flip (<=) (Pos Zero)) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)))",fontsize=16,color="black",shape="box"];266 -> 302[label="",style="solid", color="black", weight=3];
3290[label="wy40",fontsize=16,color="green",shape="box"];3291[label="wy3900",fontsize=16,color="green",shape="box"];3292[label="wy3900",fontsize=16,color="green",shape="box"];3293[label="wy40",fontsize=16,color="green",shape="box"];3294[label="wy41",fontsize=16,color="green",shape="box"];3289[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy107))) (Pos (Succ wy108)) (iterate (Pos (Succ wy109) - Pos (Succ wy108) +) (Pos (Succ wy109) - Pos (Succ wy108) + Pos (Succ wy108))) (not (primCmpNat wy110 wy111 == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];18359[label="wy110/Succ wy1100",fontsize=10,color="white",style="solid",shape="box"];3289 -> 18359[label="",style="solid", color="burlywood", weight=9];
18359 -> 3340[label="",style="solid", color="burlywood", weight=3];
18360[label="wy110/Zero",fontsize=10,color="white",style="solid",shape="box"];3289 -> 18360[label="",style="solid", color="burlywood", weight=9];
18360 -> 3341[label="",style="solid", color="burlywood", weight=3];
1252[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (Pos (Succ wy40)) (iterate (Pos (Succ wy41) - Pos (Succ wy40) +) (Pos (Succ wy41) - Pos (Succ wy40) + Pos (Succ wy40))) (not True))\n  Enum a",fontsize=16,color="black",shape="box"];1252 -> 1273[label="",style="solid", color="black", weight=3];
1253[label="map toEnum (takeWhile0 (flip (<=) (Neg wy390)) (Pos (Succ wy40)) (iterate (Pos (Succ wy41) - Pos (Succ wy40) +) (Pos (Succ wy41) - Pos (Succ wy40) + Pos (Succ wy40))) otherwise)\n  Enum a",fontsize=16,color="black",shape="box"];1253 -> 1274[label="",style="solid", color="black", weight=3];
1254[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy4600))) (Pos (Succ wy47)) (iterate (Pos (Succ wy48) - Pos (Succ wy47) +) (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47))) (not (primCmpNat (Succ wy47) (Succ wy4600) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];1254 -> 1275[label="",style="solid", color="black", weight=3];
1255[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ wy47)) (iterate (Pos (Succ wy48) - Pos (Succ wy47) +) (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47))) (not (primCmpNat (Succ wy47) Zero == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];1255 -> 1276[label="",style="solid", color="black", weight=3];
1256[label="map toEnum (takeWhile1 (flip (>=) (Neg wy460)) (Pos (Succ wy47)) (iterate (Pos (Succ wy48) - Pos (Succ wy47) +) (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47))) (not False))\n  Enum a",fontsize=16,color="black",shape="box"];1256 -> 1277[label="",style="solid", color="black", weight=3];
291[label="toEnum (Pos Zero) : map toEnum (takeWhile (flip (<=) (Pos (Succ wy500))) (iterate (Pos (Succ wy400) - Pos Zero +) (Pos (Succ wy400) - Pos Zero + Pos Zero)))",fontsize=16,color="green",shape="box"];291 -> 332[label="",style="dashed", color="green", weight=3];
291 -> 333[label="",style="dashed", color="green", weight=3];
292 -> 265[label="",style="dashed", color="red", weight=0];
292[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];293[label="map toEnum (takeWhile (flip (<=) (Pos Zero)) (iterate (Pos (Succ wy400) - Pos Zero +) (Pos (Succ wy400) - Pos Zero + Pos Zero)))",fontsize=16,color="black",shape="box"];293 -> 334[label="",style="solid", color="black", weight=3];
1400[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy60))) (Pos (Succ wy61)) (iterate (Pos Zero - Pos (Succ wy61) +) (Pos Zero - Pos (Succ wy61) + Pos (Succ wy61))) (not (primCmpNat (Succ wy620) wy63 == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];18362[label="wy63/Succ wy630",fontsize=10,color="white",style="solid",shape="box"];1400 -> 18362[label="",style="solid", color="burlywood", weight=9];
18362 -> 1443[label="",style="solid", color="burlywood", weight=3];
18363[label="wy63/Zero",fontsize=10,color="white",style="solid",shape="box"];1400 -> 18363[label="",style="solid", color="burlywood", weight=9];
18363 -> 1444[label="",style="solid", color="burlywood", weight=3];
1401[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy60))) (Pos (Succ wy61)) (iterate (Pos Zero - Pos (Succ wy61) +) (Pos Zero - Pos (Succ wy61) + Pos (Succ wy61))) (not (primCmpNat Zero wy63 == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];18364[label="wy63/Succ wy630",fontsize=10,color="white",style="solid",shape="box"];1401 -> 18364[label="",style="solid", color="burlywood", weight=9];
18364 -> 1445[label="",style="solid", color="burlywood", weight=3];
18365[label="wy63/Zero",fontsize=10,color="white",style="solid",shape="box"];1401 -> 18365[label="",style="solid", color="burlywood", weight=9];
18365 -> 1446[label="",style="solid", color="burlywood", weight=3];
298[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ wy300)) (iterate (Pos Zero - Pos (Succ wy300) +) (Pos Zero - Pos (Succ wy300) + Pos (Succ wy300))) True)",fontsize=16,color="black",shape="box"];298 -> 339[label="",style="solid", color="black", weight=3];
299 -> 265[label="",style="dashed", color="red", weight=0];
299[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];300[label="map toEnum (takeWhile (flip (<=) (Pos (Succ wy500))) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + Pos Zero)))",fontsize=16,color="black",shape="box"];300 -> 340[label="",style="solid", color="black", weight=3];
301[label="primIntToChar (Pos Zero)",fontsize=16,color="black",shape="box"];301 -> 341[label="",style="solid", color="black", weight=3];
302[label="map toEnum (takeWhile (flip (<=) (Pos Zero)) (Pos Zero - Pos Zero + Pos Zero : iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + (Pos Zero - Pos Zero + Pos Zero))))",fontsize=16,color="black",shape="box"];302 -> 342[label="",style="solid", color="black", weight=3];
3340[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy107))) (Pos (Succ wy108)) (iterate (Pos (Succ wy109) - Pos (Succ wy108) +) (Pos (Succ wy109) - Pos (Succ wy108) + Pos (Succ wy108))) (not (primCmpNat (Succ wy1100) wy111 == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];18367[label="wy111/Succ wy1110",fontsize=10,color="white",style="solid",shape="box"];3340 -> 18367[label="",style="solid", color="burlywood", weight=9];
18367 -> 3357[label="",style="solid", color="burlywood", weight=3];
18368[label="wy111/Zero",fontsize=10,color="white",style="solid",shape="box"];3340 -> 18368[label="",style="solid", color="burlywood", weight=9];
18368 -> 3358[label="",style="solid", color="burlywood", weight=3];
3341[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy107))) (Pos (Succ wy108)) (iterate (Pos (Succ wy109) - Pos (Succ wy108) +) (Pos (Succ wy109) - Pos (Succ wy108) + Pos (Succ wy108))) (not (primCmpNat Zero wy111 == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];18369[label="wy111/Succ wy1110",fontsize=10,color="white",style="solid",shape="box"];3341 -> 18369[label="",style="solid", color="burlywood", weight=9];
18369 -> 3359[label="",style="solid", color="burlywood", weight=3];
18370[label="wy111/Zero",fontsize=10,color="white",style="solid",shape="box"];3341 -> 18370[label="",style="solid", color="burlywood", weight=9];
18370 -> 3360[label="",style="solid", color="burlywood", weight=3];
1273[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (Pos (Succ wy40)) (iterate (Pos (Succ wy41) - Pos (Succ wy40) +) (Pos (Succ wy41) - Pos (Succ wy40) + Pos (Succ wy40))) False)\n  Enum a",fontsize=16,color="black",shape="box"];1273 -> 1284[label="",style="solid", color="black", weight=3];
1274[label="map toEnum (takeWhile0 (flip (<=) (Neg wy390)) (Pos (Succ wy40)) (iterate (Pos (Succ wy41) - Pos (Succ wy40) +) (Pos (Succ wy41) - Pos (Succ wy40) + Pos (Succ wy40))) True)\n  Enum a",fontsize=16,color="black",shape="box"];1274 -> 1285[label="",style="solid", color="black", weight=3];
1275 -> 3567[label="",style="dashed", color="red", weight=0];
1275[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy4600))) (Pos (Succ wy47)) (iterate (Pos (Succ wy48) - Pos (Succ wy47) +) (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47))) (not (primCmpNat wy47 wy4600 == LT)))\n  Enum a",fontsize=16,color="magenta"];1275 -> 3568[label="",style="dashed", color="magenta", weight=3];
1275 -> 3569[label="",style="dashed", color="magenta", weight=3];
1275 -> 3570[label="",style="dashed", color="magenta", weight=3];
1275 -> 3571[label="",style="dashed", color="magenta", weight=3];
1275 -> 3572[label="",style="dashed", color="magenta", weight=3];
1276[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ wy47)) (iterate (Pos (Succ wy48) - Pos (Succ wy47) +) (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47))) (not (GT == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];1276 -> 1288[label="",style="solid", color="black", weight=3];
1277[label="map toEnum (takeWhile1 (flip (>=) (Neg wy460)) (Pos (Succ wy47)) (iterate (Pos (Succ wy48) - Pos (Succ wy47) +) (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47))) True)\n  Enum a",fontsize=16,color="black",shape="box"];1277 -> 1289[label="",style="solid", color="black", weight=3];
332 -> 265[label="",style="dashed", color="red", weight=0];
332[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];333[label="map toEnum (takeWhile (flip (<=) (Pos (Succ wy500))) (iterate (Pos (Succ wy400) - Pos Zero +) (Pos (Succ wy400) - Pos Zero + Pos Zero)))",fontsize=16,color="black",shape="box"];333 -> 372[label="",style="solid", color="black", weight=3];
334[label="map toEnum (takeWhile (flip (<=) (Pos Zero)) (Pos (Succ wy400) - Pos Zero + Pos Zero : iterate (Pos (Succ wy400) - Pos Zero +) (Pos (Succ wy400) - Pos Zero + (Pos (Succ wy400) - Pos Zero + Pos Zero))))",fontsize=16,color="black",shape="box"];334 -> 373[label="",style="solid", color="black", weight=3];
1443[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy60))) (Pos (Succ wy61)) (iterate (Pos Zero - Pos (Succ wy61) +) (Pos Zero - Pos (Succ wy61) + Pos (Succ wy61))) (not (primCmpNat (Succ wy620) (Succ wy630) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];1443 -> 1492[label="",style="solid", color="black", weight=3];
1444[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy60))) (Pos (Succ wy61)) (iterate (Pos Zero - Pos (Succ wy61) +) (Pos Zero - Pos (Succ wy61) + Pos (Succ wy61))) (not (primCmpNat (Succ wy620) Zero == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];1444 -> 1493[label="",style="solid", color="black", weight=3];
1445[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy60))) (Pos (Succ wy61)) (iterate (Pos Zero - Pos (Succ wy61) +) (Pos Zero - Pos (Succ wy61) + Pos (Succ wy61))) (not (primCmpNat Zero (Succ wy630) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];1445 -> 1494[label="",style="solid", color="black", weight=3];
1446[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy60))) (Pos (Succ wy61)) (iterate (Pos Zero - Pos (Succ wy61) +) (Pos Zero - Pos (Succ wy61) + Pos (Succ wy61))) (not (primCmpNat Zero Zero == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];1446 -> 1495[label="",style="solid", color="black", weight=3];
339[label="map toEnum (Pos (Succ wy300) : takeWhile (flip (>=) (Pos Zero)) (iterate (Pos Zero - Pos (Succ wy300) +) (Pos Zero - Pos (Succ wy300) + Pos (Succ wy300))))",fontsize=16,color="black",shape="box"];339 -> 379[label="",style="solid", color="black", weight=3];
340[label="map toEnum (takeWhile (flip (<=) (Pos (Succ wy500))) (Pos Zero - Pos Zero + Pos Zero : iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + (Pos Zero - Pos Zero + Pos Zero))))",fontsize=16,color="black",shape="box"];340 -> 380[label="",style="solid", color="black", weight=3];
341[label="Char Zero",fontsize=16,color="green",shape="box"];342[label="map toEnum (takeWhile2 (flip (<=) (Pos Zero)) (Pos Zero - Pos Zero + Pos Zero : iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + (Pos Zero - Pos Zero + Pos Zero))))",fontsize=16,color="black",shape="box"];342 -> 381[label="",style="solid", color="black", weight=3];
3357[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy107))) (Pos (Succ wy108)) (iterate (Pos (Succ wy109) - Pos (Succ wy108) +) (Pos (Succ wy109) - Pos (Succ wy108) + Pos (Succ wy108))) (not (primCmpNat (Succ wy1100) (Succ wy1110) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];3357 -> 3386[label="",style="solid", color="black", weight=3];
3358[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy107))) (Pos (Succ wy108)) (iterate (Pos (Succ wy109) - Pos (Succ wy108) +) (Pos (Succ wy109) - Pos (Succ wy108) + Pos (Succ wy108))) (not (primCmpNat (Succ wy1100) Zero == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];3358 -> 3387[label="",style="solid", color="black", weight=3];
3359[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy107))) (Pos (Succ wy108)) (iterate (Pos (Succ wy109) - Pos (Succ wy108) +) (Pos (Succ wy109) - Pos (Succ wy108) + Pos (Succ wy108))) (not (primCmpNat Zero (Succ wy1110) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];3359 -> 3388[label="",style="solid", color="black", weight=3];
3360[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy107))) (Pos (Succ wy108)) (iterate (Pos (Succ wy109) - Pos (Succ wy108) +) (Pos (Succ wy109) - Pos (Succ wy108) + Pos (Succ wy108))) (not (primCmpNat Zero Zero == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];3360 -> 3389[label="",style="solid", color="black", weight=3];
1284[label="map toEnum (takeWhile0 (flip (<=) (Pos Zero)) (Pos (Succ wy40)) (iterate (Pos (Succ wy41) - Pos (Succ wy40) +) (Pos (Succ wy41) - Pos (Succ wy40) + Pos (Succ wy40))) otherwise)\n  Enum a",fontsize=16,color="black",shape="box"];1284 -> 1297[label="",style="solid", color="black", weight=3];
1285[label="map toEnum []\n  Enum a",fontsize=16,color="black",shape="triangle"];1285 -> 1298[label="",style="solid", color="black", weight=3];
3568[label="wy4600",fontsize=16,color="green",shape="box"];3569[label="wy47",fontsize=16,color="green",shape="box"];3570[label="wy47",fontsize=16,color="green",shape="box"];3571[label="wy4600",fontsize=16,color="green",shape="box"];3572[label="wy48",fontsize=16,color="green",shape="box"];3567[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy134))) (Pos (Succ wy135)) (iterate (Pos (Succ wy136) - Pos (Succ wy135) +) (Pos (Succ wy136) - Pos (Succ wy135) + Pos (Succ wy135))) (not (primCmpNat wy137 wy138 == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];18373[label="wy137/Succ wy1370",fontsize=10,color="white",style="solid",shape="box"];3567 -> 18373[label="",style="solid", color="burlywood", weight=9];
18373 -> 3618[label="",style="solid", color="burlywood", weight=3];
18374[label="wy137/Zero",fontsize=10,color="white",style="solid",shape="box"];3567 -> 18374[label="",style="solid", color="burlywood", weight=9];
18374 -> 3619[label="",style="solid", color="burlywood", weight=3];
1288[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ wy47)) (iterate (Pos (Succ wy48) - Pos (Succ wy47) +) (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47))) (not False))\n  Enum a",fontsize=16,color="black",shape="box"];1288 -> 1303[label="",style="solid", color="black", weight=3];
1289[label="map toEnum (Pos (Succ wy47) : takeWhile (flip (>=) (Neg wy460)) (iterate (Pos (Succ wy48) - Pos (Succ wy47) +) (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47))))\n  Enum a",fontsize=16,color="black",shape="box"];1289 -> 1304[label="",style="solid", color="black", weight=3];
372[label="map toEnum (takeWhile (flip (<=) (Pos (Succ wy500))) (Pos (Succ wy400) - Pos Zero + Pos Zero : iterate (Pos (Succ wy400) - Pos Zero +) (Pos (Succ wy400) - Pos Zero + (Pos (Succ wy400) - Pos Zero + Pos Zero))))",fontsize=16,color="black",shape="box"];372 -> 416[label="",style="solid", color="black", weight=3];
373[label="map toEnum (takeWhile2 (flip (<=) (Pos Zero)) (Pos (Succ wy400) - Pos Zero + Pos Zero : iterate (Pos (Succ wy400) - Pos Zero +) (Pos (Succ wy400) - Pos Zero + (Pos (Succ wy400) - Pos Zero + Pos Zero))))",fontsize=16,color="black",shape="box"];373 -> 417[label="",style="solid", color="black", weight=3];
1492 -> 1359[label="",style="dashed", color="red", weight=0];
1492[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy60))) (Pos (Succ wy61)) (iterate (Pos Zero - Pos (Succ wy61) +) (Pos Zero - Pos (Succ wy61) + Pos (Succ wy61))) (not (primCmpNat wy620 wy630 == LT)))\n  Enum a",fontsize=16,color="magenta"];1492 -> 1545[label="",style="dashed", color="magenta", weight=3];
1492 -> 1546[label="",style="dashed", color="magenta", weight=3];
1493[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy60))) (Pos (Succ wy61)) (iterate (Pos Zero - Pos (Succ wy61) +) (Pos Zero - Pos (Succ wy61) + Pos (Succ wy61))) (not (GT == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];1493 -> 1547[label="",style="solid", color="black", weight=3];
1494[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy60))) (Pos (Succ wy61)) (iterate (Pos Zero - Pos (Succ wy61) +) (Pos Zero - Pos (Succ wy61) + Pos (Succ wy61))) (not (LT == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];1494 -> 1548[label="",style="solid", color="black", weight=3];
1495[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy60))) (Pos (Succ wy61)) (iterate (Pos Zero - Pos (Succ wy61) +) (Pos Zero - Pos (Succ wy61) + Pos (Succ wy61))) (not (EQ == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];1495 -> 1549[label="",style="solid", color="black", weight=3];
379[label="toEnum (Pos (Succ wy300)) : map toEnum (takeWhile (flip (>=) (Pos Zero)) (iterate (Pos Zero - Pos (Succ wy300) +) (Pos Zero - Pos (Succ wy300) + Pos (Succ wy300))))",fontsize=16,color="green",shape="box"];379 -> 425[label="",style="dashed", color="green", weight=3];
379 -> 426[label="",style="dashed", color="green", weight=3];
380[label="map toEnum (takeWhile2 (flip (<=) (Pos (Succ wy500))) (Pos Zero - Pos Zero + Pos Zero : iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + (Pos Zero - Pos Zero + Pos Zero))))",fontsize=16,color="black",shape="box"];380 -> 427[label="",style="solid", color="black", weight=3];
381[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (Pos Zero - Pos Zero + Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + (Pos Zero - Pos Zero + Pos Zero))) (flip (<=) (Pos Zero) (Pos Zero - Pos Zero + Pos Zero)))",fontsize=16,color="black",shape="box"];381 -> 428[label="",style="solid", color="black", weight=3];
3386 -> 3289[label="",style="dashed", color="red", weight=0];
3386[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy107))) (Pos (Succ wy108)) (iterate (Pos (Succ wy109) - Pos (Succ wy108) +) (Pos (Succ wy109) - Pos (Succ wy108) + Pos (Succ wy108))) (not (primCmpNat wy1100 wy1110 == GT)))\n  Enum a",fontsize=16,color="magenta"];3386 -> 3401[label="",style="dashed", color="magenta", weight=3];
3386 -> 3402[label="",style="dashed", color="magenta", weight=3];
3387[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy107))) (Pos (Succ wy108)) (iterate (Pos (Succ wy109) - Pos (Succ wy108) +) (Pos (Succ wy109) - Pos (Succ wy108) + Pos (Succ wy108))) (not (GT == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];3387 -> 3403[label="",style="solid", color="black", weight=3];
3388[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy107))) (Pos (Succ wy108)) (iterate (Pos (Succ wy109) - Pos (Succ wy108) +) (Pos (Succ wy109) - Pos (Succ wy108) + Pos (Succ wy108))) (not (LT == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];3388 -> 3404[label="",style="solid", color="black", weight=3];
3389[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy107))) (Pos (Succ wy108)) (iterate (Pos (Succ wy109) - Pos (Succ wy108) +) (Pos (Succ wy109) - Pos (Succ wy108) + Pos (Succ wy108))) (not (EQ == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];3389 -> 3405[label="",style="solid", color="black", weight=3];
1297[label="map toEnum (takeWhile0 (flip (<=) (Pos Zero)) (Pos (Succ wy40)) (iterate (Pos (Succ wy41) - Pos (Succ wy40) +) (Pos (Succ wy41) - Pos (Succ wy40) + Pos (Succ wy40))) True)\n  Enum a",fontsize=16,color="black",shape="box"];1297 -> 1346[label="",style="solid", color="black", weight=3];
1298[label="[]\n  Enum a",fontsize=16,color="green",shape="box"];3618[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy134))) (Pos (Succ wy135)) (iterate (Pos (Succ wy136) - Pos (Succ wy135) +) (Pos (Succ wy136) - Pos (Succ wy135) + Pos (Succ wy135))) (not (primCmpNat (Succ wy1370) wy138 == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];18377[label="wy138/Succ wy1380",fontsize=10,color="white",style="solid",shape="box"];3618 -> 18377[label="",style="solid", color="burlywood", weight=9];
18377 -> 3700[label="",style="solid", color="burlywood", weight=3];
18378[label="wy138/Zero",fontsize=10,color="white",style="solid",shape="box"];3618 -> 18378[label="",style="solid", color="burlywood", weight=9];
18378 -> 3701[label="",style="solid", color="burlywood", weight=3];
3619[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy134))) (Pos (Succ wy135)) (iterate (Pos (Succ wy136) - Pos (Succ wy135) +) (Pos (Succ wy136) - Pos (Succ wy135) + Pos (Succ wy135))) (not (primCmpNat Zero wy138 == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];18379[label="wy138/Succ wy1380",fontsize=10,color="white",style="solid",shape="box"];3619 -> 18379[label="",style="solid", color="burlywood", weight=9];
18379 -> 3702[label="",style="solid", color="burlywood", weight=3];
18380[label="wy138/Zero",fontsize=10,color="white",style="solid",shape="box"];3619 -> 18380[label="",style="solid", color="burlywood", weight=9];
18380 -> 3703[label="",style="solid", color="burlywood", weight=3];
1303[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ wy47)) (iterate (Pos (Succ wy48) - Pos (Succ wy47) +) (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47))) True)\n  Enum a",fontsize=16,color="black",shape="box"];1303 -> 1351[label="",style="solid", color="black", weight=3];
1304[label="toEnum (Pos (Succ wy47)) : map toEnum (takeWhile (flip (>=) (Neg wy460)) (iterate (Pos (Succ wy48) - Pos (Succ wy47) +) (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47))))\n  Enum a",fontsize=16,color="green",shape="box"];1304 -> 1352[label="",style="dashed", color="green", weight=3];
1304 -> 1353[label="",style="dashed", color="green", weight=3];
416[label="map toEnum (takeWhile2 (flip (<=) (Pos (Succ wy500))) (Pos (Succ wy400) - Pos Zero + Pos Zero : iterate (Pos (Succ wy400) - Pos Zero +) (Pos (Succ wy400) - Pos Zero + (Pos (Succ wy400) - Pos Zero + Pos Zero))))",fontsize=16,color="black",shape="box"];416 -> 467[label="",style="solid", color="black", weight=3];
417[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (Pos (Succ wy400) - Pos Zero + Pos Zero) (iterate (Pos (Succ wy400) - Pos Zero +) (Pos (Succ wy400) - Pos Zero + (Pos (Succ wy400) - Pos Zero + Pos Zero))) (flip (<=) (Pos Zero) (Pos (Succ wy400) - Pos Zero + Pos Zero)))",fontsize=16,color="black",shape="box"];417 -> 468[label="",style="solid", color="black", weight=3];
1545[label="wy620",fontsize=16,color="green",shape="box"];1546[label="wy630",fontsize=16,color="green",shape="box"];1547[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy60))) (Pos (Succ wy61)) (iterate (Pos Zero - Pos (Succ wy61) +) (Pos Zero - Pos (Succ wy61) + Pos (Succ wy61))) (not False))\n  Enum a",fontsize=16,color="black",shape="triangle"];1547 -> 1608[label="",style="solid", color="black", weight=3];
1548[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy60))) (Pos (Succ wy61)) (iterate (Pos Zero - Pos (Succ wy61) +) (Pos Zero - Pos (Succ wy61) + Pos (Succ wy61))) (not True))\n  Enum a",fontsize=16,color="black",shape="box"];1548 -> 1609[label="",style="solid", color="black", weight=3];
1549 -> 1547[label="",style="dashed", color="red", weight=0];
1549[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy60))) (Pos (Succ wy61)) (iterate (Pos Zero - Pos (Succ wy61) +) (Pos Zero - Pos (Succ wy61) + Pos (Succ wy61))) (not False))\n  Enum a",fontsize=16,color="magenta"];425[label="toEnum (Pos (Succ wy300))",fontsize=16,color="black",shape="box"];425 -> 2902[label="",style="solid", color="black", weight=3];
426[label="map toEnum (takeWhile (flip (>=) (Pos Zero)) (iterate (Pos Zero - Pos (Succ wy300) +) (Pos Zero - Pos (Succ wy300) + Pos (Succ wy300))))",fontsize=16,color="black",shape="box"];426 -> 477[label="",style="solid", color="black", weight=3];
427[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy500))) (Pos Zero - Pos Zero + Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + (Pos Zero - Pos Zero + Pos Zero))) (flip (<=) (Pos (Succ wy500)) (Pos Zero - Pos Zero + Pos Zero)))",fontsize=16,color="black",shape="box"];427 -> 478[label="",style="solid", color="black", weight=3];
428[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (Pos Zero - Pos Zero + Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + (Pos Zero - Pos Zero + Pos Zero))) ((<=) Pos Zero - Pos Zero + Pos Zero Pos Zero))",fontsize=16,color="black",shape="box"];428 -> 479[label="",style="solid", color="black", weight=3];
3401[label="wy1110",fontsize=16,color="green",shape="box"];3402[label="wy1100",fontsize=16,color="green",shape="box"];3403[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy107))) (Pos (Succ wy108)) (iterate (Pos (Succ wy109) - Pos (Succ wy108) +) (Pos (Succ wy109) - Pos (Succ wy108) + Pos (Succ wy108))) (not True))\n  Enum a",fontsize=16,color="black",shape="box"];3403 -> 3444[label="",style="solid", color="black", weight=3];
3404[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy107))) (Pos (Succ wy108)) (iterate (Pos (Succ wy109) - Pos (Succ wy108) +) (Pos (Succ wy109) - Pos (Succ wy108) + Pos (Succ wy108))) (not False))\n  Enum a",fontsize=16,color="black",shape="triangle"];3404 -> 3445[label="",style="solid", color="black", weight=3];
3405 -> 3404[label="",style="dashed", color="red", weight=0];
3405[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy107))) (Pos (Succ wy108)) (iterate (Pos (Succ wy109) - Pos (Succ wy108) +) (Pos (Succ wy109) - Pos (Succ wy108) + Pos (Succ wy108))) (not False))\n  Enum a",fontsize=16,color="magenta"];1346 -> 1285[label="",style="dashed", color="red", weight=0];
1346[label="map toEnum []\n  Enum a",fontsize=16,color="magenta"];3700[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy134))) (Pos (Succ wy135)) (iterate (Pos (Succ wy136) - Pos (Succ wy135) +) (Pos (Succ wy136) - Pos (Succ wy135) + Pos (Succ wy135))) (not (primCmpNat (Succ wy1370) (Succ wy1380) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];3700 -> 3781[label="",style="solid", color="black", weight=3];
3701[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy134))) (Pos (Succ wy135)) (iterate (Pos (Succ wy136) - Pos (Succ wy135) +) (Pos (Succ wy136) - Pos (Succ wy135) + Pos (Succ wy135))) (not (primCmpNat (Succ wy1370) Zero == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];3701 -> 3782[label="",style="solid", color="black", weight=3];
3702[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy134))) (Pos (Succ wy135)) (iterate (Pos (Succ wy136) - Pos (Succ wy135) +) (Pos (Succ wy136) - Pos (Succ wy135) + Pos (Succ wy135))) (not (primCmpNat Zero (Succ wy1380) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];3702 -> 3783[label="",style="solid", color="black", weight=3];
3703[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy134))) (Pos (Succ wy135)) (iterate (Pos (Succ wy136) - Pos (Succ wy135) +) (Pos (Succ wy136) - Pos (Succ wy135) + Pos (Succ wy135))) (not (primCmpNat Zero Zero == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];3703 -> 3784[label="",style="solid", color="black", weight=3];
1351[label="map toEnum (Pos (Succ wy47) : takeWhile (flip (>=) (Pos Zero)) (iterate (Pos (Succ wy48) - Pos (Succ wy47) +) (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47))))\n  Enum a",fontsize=16,color="black",shape="box"];1351 -> 1414[label="",style="solid", color="black", weight=3];
1352[label="toEnum (Pos (Succ wy47))\n  Enum a",fontsize=16,color="blue",shape="box"];18384[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];1352 -> 18384[label="",style="solid", color="blue", weight=9];
18384 -> 1415[label="",style="solid", color="blue", weight=3];
18385[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];1352 -> 18385[label="",style="solid", color="blue", weight=9];
18385 -> 1416[label="",style="solid", color="blue", weight=3];
18386[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];1352 -> 18386[label="",style="solid", color="blue", weight=9];
18386 -> 1417[label="",style="solid", color="blue", weight=3];
18387[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];1352 -> 18387[label="",style="solid", color="blue", weight=9];
18387 -> 1418[label="",style="solid", color="blue", weight=3];
18388[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];1352 -> 18388[label="",style="solid", color="blue", weight=9];
18388 -> 1419[label="",style="solid", color="blue", weight=3];
18389[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];1352 -> 18389[label="",style="solid", color="blue", weight=9];
18389 -> 1420[label="",style="solid", color="blue", weight=3];
18390[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];1352 -> 18390[label="",style="solid", color="blue", weight=9];
18390 -> 1421[label="",style="solid", color="blue", weight=3];
18391[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];1352 -> 18391[label="",style="solid", color="blue", weight=9];
18391 -> 1422[label="",style="solid", color="blue", weight=3];
18392[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];1352 -> 18392[label="",style="solid", color="blue", weight=9];
18392 -> 1423[label="",style="solid", color="blue", weight=3];
1353[label="map toEnum (takeWhile (flip (>=) (Neg wy460)) (iterate (Pos (Succ wy48) - Pos (Succ wy47) +) (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47))))\n  Enum a",fontsize=16,color="black",shape="box"];1353 -> 1424[label="",style="solid", color="black", weight=3];
467[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy500))) (Pos (Succ wy400) - Pos Zero + Pos Zero) (iterate (Pos (Succ wy400) - Pos Zero +) (Pos (Succ wy400) - Pos Zero + (Pos (Succ wy400) - Pos Zero + Pos Zero))) (flip (<=) (Pos (Succ wy500)) (Pos (Succ wy400) - Pos Zero + Pos Zero)))",fontsize=16,color="black",shape="box"];467 -> 524[label="",style="solid", color="black", weight=3];
468[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (Pos (Succ wy400) - Pos Zero + Pos Zero) (iterate (Pos (Succ wy400) - Pos Zero +) (Pos (Succ wy400) - Pos Zero + (Pos (Succ wy400) - Pos Zero + Pos Zero))) ((<=) Pos (Succ wy400) - Pos Zero + Pos Zero Pos Zero))",fontsize=16,color="black",shape="box"];468 -> 525[label="",style="solid", color="black", weight=3];
1608[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy60))) (Pos (Succ wy61)) (iterate (Pos Zero - Pos (Succ wy61) +) (Pos Zero - Pos (Succ wy61) + Pos (Succ wy61))) True)\n  Enum a",fontsize=16,color="black",shape="box"];1608 -> 1680[label="",style="solid", color="black", weight=3];
1609[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy60))) (Pos (Succ wy61)) (iterate (Pos Zero - Pos (Succ wy61) +) (Pos Zero - Pos (Succ wy61) + Pos (Succ wy61))) False)\n  Enum a",fontsize=16,color="black",shape="box"];1609 -> 1681[label="",style="solid", color="black", weight=3];
2902 -> 393[label="",style="dashed", color="red", weight=0];
2902[label="primIntToChar (Pos (Succ wy300))",fontsize=16,color="magenta"];2902 -> 3102[label="",style="dashed", color="magenta", weight=3];
477[label="map toEnum (takeWhile (flip (>=) (Pos Zero)) (Pos Zero - Pos (Succ wy300) + Pos (Succ wy300) : iterate (Pos Zero - Pos (Succ wy300) +) (Pos Zero - Pos (Succ wy300) + (Pos Zero - Pos (Succ wy300) + Pos (Succ wy300)))))",fontsize=16,color="black",shape="box"];477 -> 534[label="",style="solid", color="black", weight=3];
478[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy500))) (Pos Zero - Pos Zero + Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + (Pos Zero - Pos Zero + Pos Zero))) ((<=) Pos Zero - Pos Zero + Pos Zero Pos (Succ wy500)))",fontsize=16,color="black",shape="box"];478 -> 535[label="",style="solid", color="black", weight=3];
479[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (Pos Zero - Pos Zero + Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + (Pos Zero - Pos Zero + Pos Zero))) (compare (Pos Zero - Pos Zero + Pos Zero) (Pos Zero) /= GT))",fontsize=16,color="black",shape="box"];479 -> 536[label="",style="solid", color="black", weight=3];
3444[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy107))) (Pos (Succ wy108)) (iterate (Pos (Succ wy109) - Pos (Succ wy108) +) (Pos (Succ wy109) - Pos (Succ wy108) + Pos (Succ wy108))) False)\n  Enum a",fontsize=16,color="black",shape="box"];3444 -> 3449[label="",style="solid", color="black", weight=3];
3445[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy107))) (Pos (Succ wy108)) (iterate (Pos (Succ wy109) - Pos (Succ wy108) +) (Pos (Succ wy109) - Pos (Succ wy108) + Pos (Succ wy108))) True)\n  Enum a",fontsize=16,color="black",shape="box"];3445 -> 3450[label="",style="solid", color="black", weight=3];
3781 -> 3567[label="",style="dashed", color="red", weight=0];
3781[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy134))) (Pos (Succ wy135)) (iterate (Pos (Succ wy136) - Pos (Succ wy135) +) (Pos (Succ wy136) - Pos (Succ wy135) + Pos (Succ wy135))) (not (primCmpNat wy1370 wy1380 == LT)))\n  Enum a",fontsize=16,color="magenta"];3781 -> 3884[label="",style="dashed", color="magenta", weight=3];
3781 -> 3885[label="",style="dashed", color="magenta", weight=3];
3782[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy134))) (Pos (Succ wy135)) (iterate (Pos (Succ wy136) - Pos (Succ wy135) +) (Pos (Succ wy136) - Pos (Succ wy135) + Pos (Succ wy135))) (not (GT == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];3782 -> 3886[label="",style="solid", color="black", weight=3];
3783[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy134))) (Pos (Succ wy135)) (iterate (Pos (Succ wy136) - Pos (Succ wy135) +) (Pos (Succ wy136) - Pos (Succ wy135) + Pos (Succ wy135))) (not (LT == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];3783 -> 3887[label="",style="solid", color="black", weight=3];
3784[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy134))) (Pos (Succ wy135)) (iterate (Pos (Succ wy136) - Pos (Succ wy135) +) (Pos (Succ wy136) - Pos (Succ wy135) + Pos (Succ wy135))) (not (EQ == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];3784 -> 3888[label="",style="solid", color="black", weight=3];
1414[label="toEnum (Pos (Succ wy47)) : map toEnum (takeWhile (flip (>=) (Pos Zero)) (iterate (Pos (Succ wy48) - Pos (Succ wy47) +) (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47))))\n  Enum a",fontsize=16,color="green",shape="box"];1414 -> 1462[label="",style="dashed", color="green", weight=3];
1414 -> 1463[label="",style="dashed", color="green", weight=3];
1415[label="toEnum (Pos (Succ wy47))",fontsize=16,color="black",shape="box"];1415 -> 3041[label="",style="solid", color="black", weight=3];
1416[label="toEnum (Pos (Succ wy47))\n  Integral a",fontsize=16,color="black",shape="box"];1416 -> 2929[label="",style="solid", color="black", weight=3];
1417[label="toEnum (Pos (Succ wy47))",fontsize=16,color="black",shape="box"];1417 -> 3032[label="",style="solid", color="black", weight=3];
1418[label="toEnum (Pos (Succ wy47))",fontsize=16,color="black",shape="box"];1418 -> 2871[label="",style="solid", color="black", weight=3];
1419[label="toEnum (Pos (Succ wy47))",fontsize=16,color="black",shape="box"];1419 -> 3026[label="",style="solid", color="black", weight=3];
1420[label="toEnum (Pos (Succ wy47))",fontsize=16,color="black",shape="box"];1420 -> 3006[label="",style="solid", color="black", weight=3];
1421[label="toEnum (Pos (Succ wy47))",fontsize=16,color="black",shape="box"];1421 -> 2953[label="",style="solid", color="black", weight=3];
1422[label="toEnum (Pos (Succ wy47))",fontsize=16,color="black",shape="box"];1422 -> 3014[label="",style="solid", color="black", weight=3];
1423[label="toEnum (Pos (Succ wy47))",fontsize=16,color="black",shape="box"];1423 -> 2888[label="",style="solid", color="black", weight=3];
1424[label="map toEnum (takeWhile (flip (>=) (Neg wy460)) (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47) : iterate (Pos (Succ wy48) - Pos (Succ wy47) +) (Pos (Succ wy48) - Pos (Succ wy47) + (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47)))))\n  Enum a",fontsize=16,color="black",shape="box"];1424 -> 1473[label="",style="solid", color="black", weight=3];
524[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy500))) (Pos (Succ wy400) - Pos Zero + Pos Zero) (iterate (Pos (Succ wy400) - Pos Zero +) (Pos (Succ wy400) - Pos Zero + (Pos (Succ wy400) - Pos Zero + Pos Zero))) ((<=) Pos (Succ wy400) - Pos Zero + Pos Zero Pos (Succ wy500)))",fontsize=16,color="black",shape="box"];524 -> 592[label="",style="solid", color="black", weight=3];
525[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (Pos (Succ wy400) - Pos Zero + Pos Zero) (iterate (Pos (Succ wy400) - Pos Zero +) (Pos (Succ wy400) - Pos Zero + (Pos (Succ wy400) - Pos Zero + Pos Zero))) (compare (Pos (Succ wy400) - Pos Zero + Pos Zero) (Pos Zero) /= GT))",fontsize=16,color="black",shape="box"];525 -> 593[label="",style="solid", color="black", weight=3];
1680[label="map toEnum (Pos (Succ wy61) : takeWhile (flip (>=) (Pos (Succ wy60))) (iterate (Pos Zero - Pos (Succ wy61) +) (Pos Zero - Pos (Succ wy61) + Pos (Succ wy61))))\n  Enum a",fontsize=16,color="black",shape="box"];1680 -> 1758[label="",style="solid", color="black", weight=3];
1681[label="map toEnum (takeWhile0 (flip (>=) (Pos (Succ wy60))) (Pos (Succ wy61)) (iterate (Pos Zero - Pos (Succ wy61) +) (Pos Zero - Pos (Succ wy61) + Pos (Succ wy61))) otherwise)\n  Enum a",fontsize=16,color="black",shape="box"];1681 -> 1759[label="",style="solid", color="black", weight=3];
3102[label="Pos (Succ wy300)",fontsize=16,color="green",shape="box"];393[label="primIntToChar wy10",fontsize=16,color="burlywood",shape="triangle"];18395[label="wy10/Pos wy100",fontsize=10,color="white",style="solid",shape="box"];393 -> 18395[label="",style="solid", color="burlywood", weight=9];
18395 -> 440[label="",style="solid", color="burlywood", weight=3];
18396[label="wy10/Neg wy100",fontsize=10,color="white",style="solid",shape="box"];393 -> 18396[label="",style="solid", color="burlywood", weight=9];
18396 -> 441[label="",style="solid", color="burlywood", weight=3];
534[label="map toEnum (takeWhile2 (flip (>=) (Pos Zero)) (Pos Zero - Pos (Succ wy300) + Pos (Succ wy300) : iterate (Pos Zero - Pos (Succ wy300) +) (Pos Zero - Pos (Succ wy300) + (Pos Zero - Pos (Succ wy300) + Pos (Succ wy300)))))",fontsize=16,color="black",shape="box"];534 -> 606[label="",style="solid", color="black", weight=3];
535[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy500))) (Pos Zero - Pos Zero + Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + (Pos Zero - Pos Zero + Pos Zero))) (compare (Pos Zero - Pos Zero + Pos Zero) (Pos (Succ wy500)) /= GT))",fontsize=16,color="black",shape="box"];535 -> 607[label="",style="solid", color="black", weight=3];
536[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (Pos Zero - Pos Zero + Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + (Pos Zero - Pos Zero + Pos Zero))) (not (compare (Pos Zero - Pos Zero + Pos Zero) (Pos Zero) == GT)))",fontsize=16,color="black",shape="box"];536 -> 608[label="",style="solid", color="black", weight=3];
3449[label="map toEnum (takeWhile0 (flip (<=) (Pos (Succ wy107))) (Pos (Succ wy108)) (iterate (Pos (Succ wy109) - Pos (Succ wy108) +) (Pos (Succ wy109) - Pos (Succ wy108) + Pos (Succ wy108))) otherwise)\n  Enum a",fontsize=16,color="black",shape="box"];3449 -> 3454[label="",style="solid", color="black", weight=3];
3450[label="map toEnum (Pos (Succ wy108) : takeWhile (flip (<=) (Pos (Succ wy107))) (iterate (Pos (Succ wy109) - Pos (Succ wy108) +) (Pos (Succ wy109) - Pos (Succ wy108) + Pos (Succ wy108))))\n  Enum a",fontsize=16,color="black",shape="box"];3450 -> 3455[label="",style="solid", color="black", weight=3];
3884[label="wy1380",fontsize=16,color="green",shape="box"];3885[label="wy1370",fontsize=16,color="green",shape="box"];3886[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy134))) (Pos (Succ wy135)) (iterate (Pos (Succ wy136) - Pos (Succ wy135) +) (Pos (Succ wy136) - Pos (Succ wy135) + Pos (Succ wy135))) (not False))\n  Enum a",fontsize=16,color="black",shape="triangle"];3886 -> 3992[label="",style="solid", color="black", weight=3];
3887[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy134))) (Pos (Succ wy135)) (iterate (Pos (Succ wy136) - Pos (Succ wy135) +) (Pos (Succ wy136) - Pos (Succ wy135) + Pos (Succ wy135))) (not True))\n  Enum a",fontsize=16,color="black",shape="box"];3887 -> 3993[label="",style="solid", color="black", weight=3];
3888 -> 3886[label="",style="dashed", color="red", weight=0];
3888[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy134))) (Pos (Succ wy135)) (iterate (Pos (Succ wy136) - Pos (Succ wy135) +) (Pos (Succ wy136) - Pos (Succ wy135) + Pos (Succ wy135))) (not False))\n  Enum a",fontsize=16,color="magenta"];1462[label="toEnum (Pos (Succ wy47))\n  Enum a",fontsize=16,color="blue",shape="box"];18398[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];1462 -> 18398[label="",style="solid", color="blue", weight=9];
18398 -> 1515[label="",style="solid", color="blue", weight=3];
18399[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];1462 -> 18399[label="",style="solid", color="blue", weight=9];
18399 -> 1516[label="",style="solid", color="blue", weight=3];
18400[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];1462 -> 18400[label="",style="solid", color="blue", weight=9];
18400 -> 1517[label="",style="solid", color="blue", weight=3];
18401[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];1462 -> 18401[label="",style="solid", color="blue", weight=9];
18401 -> 1518[label="",style="solid", color="blue", weight=3];
18402[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];1462 -> 18402[label="",style="solid", color="blue", weight=9];
18402 -> 1519[label="",style="solid", color="blue", weight=3];
18403[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];1462 -> 18403[label="",style="solid", color="blue", weight=9];
18403 -> 1520[label="",style="solid", color="blue", weight=3];
18404[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];1462 -> 18404[label="",style="solid", color="blue", weight=9];
18404 -> 1521[label="",style="solid", color="blue", weight=3];
18405[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];1462 -> 18405[label="",style="solid", color="blue", weight=9];
18405 -> 1522[label="",style="solid", color="blue", weight=3];
18406[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];1462 -> 18406[label="",style="solid", color="blue", weight=9];
18406 -> 1523[label="",style="solid", color="blue", weight=3];
1463[label="map toEnum (takeWhile (flip (>=) (Pos Zero)) (iterate (Pos (Succ wy48) - Pos (Succ wy47) +) (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47))))\n  Enum a",fontsize=16,color="black",shape="box"];1463 -> 1524[label="",style="solid", color="black", weight=3];
3041[label="error []",fontsize=16,color="red",shape="box"];2929[label="error []",fontsize=16,color="red",shape="box"];3032[label="error []",fontsize=16,color="red",shape="box"];2871[label="error []",fontsize=16,color="red",shape="box"];3026[label="error []",fontsize=16,color="red",shape="box"];3006[label="error []",fontsize=16,color="red",shape="box"];2953 -> 393[label="",style="dashed", color="red", weight=0];
2953[label="primIntToChar (Pos (Succ wy47))",fontsize=16,color="magenta"];2953 -> 3103[label="",style="dashed", color="magenta", weight=3];
3014[label="error []",fontsize=16,color="red",shape="box"];2888[label="error []",fontsize=16,color="red",shape="box"];1473[label="map toEnum (takeWhile2 (flip (>=) (Neg wy460)) (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47) : iterate (Pos (Succ wy48) - Pos (Succ wy47) +) (Pos (Succ wy48) - Pos (Succ wy47) + (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47)))))\n  Enum a",fontsize=16,color="black",shape="box"];1473 -> 1525[label="",style="solid", color="black", weight=3];
592[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy500))) (Pos (Succ wy400) - Pos Zero + Pos Zero) (iterate (Pos (Succ wy400) - Pos Zero +) (Pos (Succ wy400) - Pos Zero + (Pos (Succ wy400) - Pos Zero + Pos Zero))) (compare (Pos (Succ wy400) - Pos Zero + Pos Zero) (Pos (Succ wy500)) /= GT))",fontsize=16,color="black",shape="box"];592 -> 673[label="",style="solid", color="black", weight=3];
593[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (Pos (Succ wy400) - Pos Zero + Pos Zero) (iterate (Pos (Succ wy400) - Pos Zero +) (Pos (Succ wy400) - Pos Zero + (Pos (Succ wy400) - Pos Zero + Pos Zero))) (not (compare (Pos (Succ wy400) - Pos Zero + Pos Zero) (Pos Zero) == GT)))",fontsize=16,color="black",shape="box"];593 -> 674[label="",style="solid", color="black", weight=3];
1758[label="toEnum (Pos (Succ wy61)) : map toEnum (takeWhile (flip (>=) (Pos (Succ wy60))) (iterate (Pos Zero - Pos (Succ wy61) +) (Pos Zero - Pos (Succ wy61) + Pos (Succ wy61))))\n  Enum a",fontsize=16,color="green",shape="box"];1758 -> 1842[label="",style="dashed", color="green", weight=3];
1758 -> 1843[label="",style="dashed", color="green", weight=3];
1759[label="map toEnum (takeWhile0 (flip (>=) (Pos (Succ wy60))) (Pos (Succ wy61)) (iterate (Pos Zero - Pos (Succ wy61) +) (Pos Zero - Pos (Succ wy61) + Pos (Succ wy61))) True)\n  Enum a",fontsize=16,color="black",shape="box"];1759 -> 1844[label="",style="solid", color="black", weight=3];
440[label="primIntToChar (Pos wy100)",fontsize=16,color="black",shape="box"];440 -> 492[label="",style="solid", color="black", weight=3];
441[label="primIntToChar (Neg wy100)",fontsize=16,color="burlywood",shape="box"];18408[label="wy100/Succ wy1000",fontsize=10,color="white",style="solid",shape="box"];441 -> 18408[label="",style="solid", color="burlywood", weight=9];
18408 -> 493[label="",style="solid", color="burlywood", weight=3];
18409[label="wy100/Zero",fontsize=10,color="white",style="solid",shape="box"];441 -> 18409[label="",style="solid", color="burlywood", weight=9];
18409 -> 494[label="",style="solid", color="burlywood", weight=3];
606[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos Zero - Pos (Succ wy300) + Pos (Succ wy300)) (iterate (Pos Zero - Pos (Succ wy300) +) (Pos Zero - Pos (Succ wy300) + (Pos Zero - Pos (Succ wy300) + Pos (Succ wy300)))) (flip (>=) (Pos Zero) (Pos Zero - Pos (Succ wy300) + Pos (Succ wy300))))",fontsize=16,color="black",shape="box"];606 -> 686[label="",style="solid", color="black", weight=3];
607[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy500))) (Pos Zero - Pos Zero + Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + (Pos Zero - Pos Zero + Pos Zero))) (not (compare (Pos Zero - Pos Zero + Pos Zero) (Pos (Succ wy500)) == GT)))",fontsize=16,color="black",shape="box"];607 -> 687[label="",style="solid", color="black", weight=3];
608[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (Pos Zero - Pos Zero + Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + (Pos Zero - Pos Zero + Pos Zero))) (not (primCmpInt (Pos Zero - Pos Zero + Pos Zero) (Pos Zero) == GT)))",fontsize=16,color="black",shape="box"];608 -> 688[label="",style="solid", color="black", weight=3];
3454[label="map toEnum (takeWhile0 (flip (<=) (Pos (Succ wy107))) (Pos (Succ wy108)) (iterate (Pos (Succ wy109) - Pos (Succ wy108) +) (Pos (Succ wy109) - Pos (Succ wy108) + Pos (Succ wy108))) True)\n  Enum a",fontsize=16,color="black",shape="box"];3454 -> 3501[label="",style="solid", color="black", weight=3];
3455[label="toEnum (Pos (Succ wy108)) : map toEnum (takeWhile (flip (<=) (Pos (Succ wy107))) (iterate (Pos (Succ wy109) - Pos (Succ wy108) +) (Pos (Succ wy109) - Pos (Succ wy108) + Pos (Succ wy108))))\n  Enum a",fontsize=16,color="green",shape="box"];3455 -> 3502[label="",style="dashed", color="green", weight=3];
3455 -> 3503[label="",style="dashed", color="green", weight=3];
3992[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy134))) (Pos (Succ wy135)) (iterate (Pos (Succ wy136) - Pos (Succ wy135) +) (Pos (Succ wy136) - Pos (Succ wy135) + Pos (Succ wy135))) True)\n  Enum a",fontsize=16,color="black",shape="box"];3992 -> 4114[label="",style="solid", color="black", weight=3];
3993[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy134))) (Pos (Succ wy135)) (iterate (Pos (Succ wy136) - Pos (Succ wy135) +) (Pos (Succ wy136) - Pos (Succ wy135) + Pos (Succ wy135))) False)\n  Enum a",fontsize=16,color="black",shape="box"];3993 -> 4115[label="",style="solid", color="black", weight=3];
1515[label="toEnum (Pos (Succ wy47))",fontsize=16,color="black",shape="box"];1515 -> 2991[label="",style="solid", color="black", weight=3];
1516[label="toEnum (Pos (Succ wy47))\n  Integral a",fontsize=16,color="black",shape="box"];1516 -> 2883[label="",style="solid", color="black", weight=3];
1517[label="toEnum (Pos (Succ wy47))",fontsize=16,color="black",shape="box"];1517 -> 2862[label="",style="solid", color="black", weight=3];
1518[label="toEnum (Pos (Succ wy47))",fontsize=16,color="black",shape="box"];1518 -> 2963[label="",style="solid", color="black", weight=3];
1519[label="toEnum (Pos (Succ wy47))",fontsize=16,color="black",shape="box"];1519 -> 2956[label="",style="solid", color="black", weight=3];
1520[label="toEnum (Pos (Succ wy47))",fontsize=16,color="black",shape="box"];1520 -> 2898[label="",style="solid", color="black", weight=3];
1521[label="toEnum (Pos (Succ wy47))",fontsize=16,color="black",shape="box"];1521 -> 2885[label="",style="solid", color="black", weight=3];
1522[label="toEnum (Pos (Succ wy47))",fontsize=16,color="black",shape="box"];1522 -> 3051[label="",style="solid", color="black", weight=3];
1523[label="toEnum (Pos (Succ wy47))",fontsize=16,color="black",shape="box"];1523 -> 2918[label="",style="solid", color="black", weight=3];
1524[label="map toEnum (takeWhile (flip (>=) (Pos Zero)) (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47) : iterate (Pos (Succ wy48) - Pos (Succ wy47) +) (Pos (Succ wy48) - Pos (Succ wy47) + (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47)))))\n  Enum a",fontsize=16,color="black",shape="box"];1524 -> 1586[label="",style="solid", color="black", weight=3];
3103[label="Pos (Succ wy47)",fontsize=16,color="green",shape="box"];1525[label="map toEnum (takeWhile1 (flip (>=) (Neg wy460)) (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47)) (iterate (Pos (Succ wy48) - Pos (Succ wy47) +) (Pos (Succ wy48) - Pos (Succ wy47) + (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47)))) (flip (>=) (Neg wy460) (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47))))\n  Enum a",fontsize=16,color="black",shape="box"];1525 -> 1587[label="",style="solid", color="black", weight=3];
673[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy500))) (Pos (Succ wy400) - Pos Zero + Pos Zero) (iterate (Pos (Succ wy400) - Pos Zero +) (Pos (Succ wy400) - Pos Zero + (Pos (Succ wy400) - Pos Zero + Pos Zero))) (not (compare (Pos (Succ wy400) - Pos Zero + Pos Zero) (Pos (Succ wy500)) == GT)))",fontsize=16,color="black",shape="box"];673 -> 760[label="",style="solid", color="black", weight=3];
674[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (Pos (Succ wy400) - Pos Zero + Pos Zero) (iterate (Pos (Succ wy400) - Pos Zero +) (Pos (Succ wy400) - Pos Zero + (Pos (Succ wy400) - Pos Zero + Pos Zero))) (not (primCmpInt (Pos (Succ wy400) - Pos Zero + Pos Zero) (Pos Zero) == GT)))",fontsize=16,color="black",shape="box"];674 -> 761[label="",style="solid", color="black", weight=3];
1842[label="toEnum (Pos (Succ wy61))\n  Enum a",fontsize=16,color="blue",shape="box"];18410[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];1842 -> 18410[label="",style="solid", color="blue", weight=9];
18410 -> 1884[label="",style="solid", color="blue", weight=3];
18411[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];1842 -> 18411[label="",style="solid", color="blue", weight=9];
18411 -> 1885[label="",style="solid", color="blue", weight=3];
18412[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];1842 -> 18412[label="",style="solid", color="blue", weight=9];
18412 -> 1886[label="",style="solid", color="blue", weight=3];
18413[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];1842 -> 18413[label="",style="solid", color="blue", weight=9];
18413 -> 1887[label="",style="solid", color="blue", weight=3];
18414[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];1842 -> 18414[label="",style="solid", color="blue", weight=9];
18414 -> 1888[label="",style="solid", color="blue", weight=3];
18415[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];1842 -> 18415[label="",style="solid", color="blue", weight=9];
18415 -> 1889[label="",style="solid", color="blue", weight=3];
18416[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];1842 -> 18416[label="",style="solid", color="blue", weight=9];
18416 -> 1890[label="",style="solid", color="blue", weight=3];
18417[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];1842 -> 18417[label="",style="solid", color="blue", weight=9];
18417 -> 1891[label="",style="solid", color="blue", weight=3];
18418[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];1842 -> 18418[label="",style="solid", color="blue", weight=9];
18418 -> 1892[label="",style="solid", color="blue", weight=3];
1843[label="map toEnum (takeWhile (flip (>=) (Pos (Succ wy60))) (iterate (Pos Zero - Pos (Succ wy61) +) (Pos Zero - Pos (Succ wy61) + Pos (Succ wy61))))\n  Enum a",fontsize=16,color="black",shape="box"];1843 -> 1893[label="",style="solid", color="black", weight=3];
1844 -> 1285[label="",style="dashed", color="red", weight=0];
1844[label="map toEnum []\n  Enum a",fontsize=16,color="magenta"];492[label="Char wy100",fontsize=16,color="green",shape="box"];493[label="primIntToChar (Neg (Succ wy1000))",fontsize=16,color="black",shape="box"];493 -> 551[label="",style="solid", color="black", weight=3];
494[label="primIntToChar (Neg Zero)",fontsize=16,color="black",shape="box"];494 -> 552[label="",style="solid", color="black", weight=3];
686[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos Zero - Pos (Succ wy300) + Pos (Succ wy300)) (iterate (Pos Zero - Pos (Succ wy300) +) (Pos Zero - Pos (Succ wy300) + (Pos Zero - Pos (Succ wy300) + Pos (Succ wy300)))) ((>=) Pos Zero - Pos (Succ wy300) + Pos (Succ wy300) Pos Zero))",fontsize=16,color="black",shape="box"];686 -> 772[label="",style="solid", color="black", weight=3];
687[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy500))) (Pos Zero - Pos Zero + Pos Zero) (iterate (Pos Zero - Pos Zero +) (Pos Zero - Pos Zero + (Pos Zero - Pos Zero + Pos Zero))) (not (primCmpInt (Pos Zero - Pos Zero + Pos Zero) (Pos (Succ wy500)) == GT)))",fontsize=16,color="black",shape="box"];687 -> 773[label="",style="solid", color="black", weight=3];
688[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (primPlusInt (Pos Zero - Pos Zero) (Pos Zero)) (iterate (primPlusInt (Pos Zero - Pos Zero)) (primPlusInt (Pos Zero - Pos Zero) (primPlusInt (Pos Zero - Pos Zero) (Pos Zero)))) (not (primCmpInt (primPlusInt (Pos Zero - Pos Zero) (Pos Zero)) (Pos Zero) == GT)))",fontsize=16,color="black",shape="box"];688 -> 774[label="",style="solid", color="black", weight=3];
3501 -> 1285[label="",style="dashed", color="red", weight=0];
3501[label="map toEnum []\n  Enum a",fontsize=16,color="magenta"];3502[label="toEnum (Pos (Succ wy108))\n  Enum a",fontsize=16,color="blue",shape="box"];18421[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];3502 -> 18421[label="",style="solid", color="blue", weight=9];
18421 -> 3620[label="",style="solid", color="blue", weight=3];
18422[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];3502 -> 18422[label="",style="solid", color="blue", weight=9];
18422 -> 3621[label="",style="solid", color="blue", weight=3];
18423[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];3502 -> 18423[label="",style="solid", color="blue", weight=9];
18423 -> 3622[label="",style="solid", color="blue", weight=3];
18424[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];3502 -> 18424[label="",style="solid", color="blue", weight=9];
18424 -> 3623[label="",style="solid", color="blue", weight=3];
18425[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];3502 -> 18425[label="",style="solid", color="blue", weight=9];
18425 -> 3624[label="",style="solid", color="blue", weight=3];
18426[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];3502 -> 18426[label="",style="solid", color="blue", weight=9];
18426 -> 3625[label="",style="solid", color="blue", weight=3];
18427[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];3502 -> 18427[label="",style="solid", color="blue", weight=9];
18427 -> 3626[label="",style="solid", color="blue", weight=3];
18428[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];3502 -> 18428[label="",style="solid", color="blue", weight=9];
18428 -> 3627[label="",style="solid", color="blue", weight=3];
18429[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];3502 -> 18429[label="",style="solid", color="blue", weight=9];
18429 -> 3628[label="",style="solid", color="blue", weight=3];
3503[label="map toEnum (takeWhile (flip (<=) (Pos (Succ wy107))) (iterate (Pos (Succ wy109) - Pos (Succ wy108) +) (Pos (Succ wy109) - Pos (Succ wy108) + Pos (Succ wy108))))\n  Enum a",fontsize=16,color="black",shape="box"];3503 -> 3629[label="",style="solid", color="black", weight=3];
4114[label="map toEnum (Pos (Succ wy135) : takeWhile (flip (>=) (Pos (Succ wy134))) (iterate (Pos (Succ wy136) - Pos (Succ wy135) +) (Pos (Succ wy136) - Pos (Succ wy135) + Pos (Succ wy135))))\n  Enum a",fontsize=16,color="black",shape="box"];4114 -> 4225[label="",style="solid", color="black", weight=3];
4115[label="map toEnum (takeWhile0 (flip (>=) (Pos (Succ wy134))) (Pos (Succ wy135)) (iterate (Pos (Succ wy136) - Pos (Succ wy135) +) (Pos (Succ wy136) - Pos (Succ wy135) + Pos (Succ wy135))) otherwise)\n  Enum a",fontsize=16,color="black",shape="box"];4115 -> 4226[label="",style="solid", color="black", weight=3];
2991[label="error []",fontsize=16,color="red",shape="box"];2883[label="error []",fontsize=16,color="red",shape="box"];2862[label="error []",fontsize=16,color="red",shape="box"];2963[label="error []",fontsize=16,color="red",shape="box"];2956[label="error []",fontsize=16,color="red",shape="box"];2898[label="error []",fontsize=16,color="red",shape="box"];2885 -> 393[label="",style="dashed", color="red", weight=0];
2885[label="primIntToChar (Pos (Succ wy47))",fontsize=16,color="magenta"];2885 -> 3104[label="",style="dashed", color="magenta", weight=3];
3051[label="error []",fontsize=16,color="red",shape="box"];2918[label="error []",fontsize=16,color="red",shape="box"];1586[label="map toEnum (takeWhile2 (flip (>=) (Pos Zero)) (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47) : iterate (Pos (Succ wy48) - Pos (Succ wy47) +) (Pos (Succ wy48) - Pos (Succ wy47) + (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47)))))\n  Enum a",fontsize=16,color="black",shape="box"];1586 -> 1650[label="",style="solid", color="black", weight=3];
1587[label="map toEnum (takeWhile1 (flip (>=) (Neg wy460)) (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47)) (iterate (Pos (Succ wy48) - Pos (Succ wy47) +) (Pos (Succ wy48) - Pos (Succ wy47) + (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47)))) ((>=) Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47) Neg wy460))\n  Enum a",fontsize=16,color="black",shape="box"];1587 -> 1651[label="",style="solid", color="black", weight=3];
760[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy500))) (Pos (Succ wy400) - Pos Zero + Pos Zero) (iterate (Pos (Succ wy400) - Pos Zero +) (Pos (Succ wy400) - Pos Zero + (Pos (Succ wy400) - Pos Zero + Pos Zero))) (not (primCmpInt (Pos (Succ wy400) - Pos Zero + Pos Zero) (Pos (Succ wy500)) == GT)))",fontsize=16,color="black",shape="box"];760 -> 828[label="",style="solid", color="black", weight=3];
761[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (primPlusInt (Pos (Succ wy400) - Pos Zero) (Pos Zero)) (iterate (primPlusInt (Pos (Succ wy400) - Pos Zero)) (primPlusInt (Pos (Succ wy400) - Pos Zero) (primPlusInt (Pos (Succ wy400) - Pos Zero) (Pos Zero)))) (not (primCmpInt (primPlusInt (Pos (Succ wy400) - Pos Zero) (Pos Zero)) (Pos Zero) == GT)))",fontsize=16,color="black",shape="box"];761 -> 829[label="",style="solid", color="black", weight=3];
1884[label="toEnum (Pos (Succ wy61))",fontsize=16,color="black",shape="box"];1884 -> 3013[label="",style="solid", color="black", weight=3];
1885[label="toEnum (Pos (Succ wy61))\n  Integral a",fontsize=16,color="black",shape="box"];1885 -> 2993[label="",style="solid", color="black", weight=3];
1886[label="toEnum (Pos (Succ wy61))",fontsize=16,color="black",shape="box"];1886 -> 2981[label="",style="solid", color="black", weight=3];
1887[label="toEnum (Pos (Succ wy61))",fontsize=16,color="black",shape="box"];1887 -> 2992[label="",style="solid", color="black", weight=3];
1888[label="toEnum (Pos (Succ wy61))",fontsize=16,color="black",shape="box"];1888 -> 3034[label="",style="solid", color="black", weight=3];
1889[label="toEnum (Pos (Succ wy61))",fontsize=16,color="black",shape="box"];1889 -> 2934[label="",style="solid", color="black", weight=3];
1890[label="toEnum (Pos (Succ wy61))",fontsize=16,color="black",shape="box"];1890 -> 2974[label="",style="solid", color="black", weight=3];
1891[label="toEnum (Pos (Succ wy61))",fontsize=16,color="black",shape="box"];1891 -> 2870[label="",style="solid", color="black", weight=3];
1892[label="toEnum (Pos (Succ wy61))",fontsize=16,color="black",shape="box"];1892 -> 2909[label="",style="solid", color="black", weight=3];
1893[label="map toEnum (takeWhile (flip (>=) (Pos (Succ wy60))) (Pos Zero - Pos (Succ wy61) + Pos (Succ wy61) : iterate (Pos Zero - Pos (Succ wy61) +) (Pos Zero - Pos (Succ wy61) + (Pos Zero - Pos (Succ wy61) + Pos (Succ wy61)))))\n  Enum a",fontsize=16,color="black",shape="box"];1893 -> 1959[label="",style="solid", color="black", weight=3];
551[label="error []",fontsize=16,color="red",shape="box"];552[label="Char Zero",fontsize=16,color="green",shape="box"];772[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos Zero - Pos (Succ wy300) + Pos (Succ wy300)) (iterate (Pos Zero - Pos (Succ wy300) +) (Pos Zero - Pos (Succ wy300) + (Pos Zero - Pos (Succ wy300) + Pos (Succ wy300)))) (compare (Pos Zero - Pos (Succ wy300) + Pos (Succ wy300)) (Pos Zero) /= LT))",fontsize=16,color="black",shape="box"];772 -> 844[label="",style="solid", color="black", weight=3];
773[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy500))) (primPlusInt (Pos Zero - Pos Zero) (Pos Zero)) (iterate (primPlusInt (Pos Zero - Pos Zero)) (primPlusInt (Pos Zero - Pos Zero) (primPlusInt (Pos Zero - Pos Zero) (Pos Zero)))) (not (primCmpInt (primPlusInt (Pos Zero - Pos Zero) (Pos Zero)) (Pos (Succ wy500)) == GT)))",fontsize=16,color="black",shape="box"];773 -> 845[label="",style="solid", color="black", weight=3];
774[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (primPlusInt (primMinusInt (Pos Zero) (Pos Zero)) (Pos Zero)) (iterate (primPlusInt (primMinusInt (Pos Zero) (Pos Zero))) (primPlusInt (primMinusInt (Pos Zero) (Pos Zero)) (primPlusInt (primMinusInt (Pos Zero) (Pos Zero)) (Pos Zero)))) (not (primCmpInt (primPlusInt (primMinusInt (Pos Zero) (Pos Zero)) (Pos Zero)) (Pos Zero) == GT)))",fontsize=16,color="black",shape="box"];774 -> 846[label="",style="solid", color="black", weight=3];
3620[label="toEnum (Pos (Succ wy108))",fontsize=16,color="black",shape="box"];3620 -> 5465[label="",style="solid", color="black", weight=3];
3621[label="toEnum (Pos (Succ wy108))\n  Integral a",fontsize=16,color="black",shape="box"];3621 -> 5466[label="",style="solid", color="black", weight=3];
3622[label="toEnum (Pos (Succ wy108))",fontsize=16,color="black",shape="box"];3622 -> 5467[label="",style="solid", color="black", weight=3];
3623[label="toEnum (Pos (Succ wy108))",fontsize=16,color="black",shape="box"];3623 -> 5468[label="",style="solid", color="black", weight=3];
3624[label="toEnum (Pos (Succ wy108))",fontsize=16,color="black",shape="box"];3624 -> 5469[label="",style="solid", color="black", weight=3];
3625[label="toEnum (Pos (Succ wy108))",fontsize=16,color="black",shape="box"];3625 -> 5470[label="",style="solid", color="black", weight=3];
3626[label="toEnum (Pos (Succ wy108))",fontsize=16,color="black",shape="box"];3626 -> 5471[label="",style="solid", color="black", weight=3];
3627[label="toEnum (Pos (Succ wy108))",fontsize=16,color="black",shape="box"];3627 -> 5472[label="",style="solid", color="black", weight=3];
3628[label="toEnum (Pos (Succ wy108))",fontsize=16,color="black",shape="box"];3628 -> 5473[label="",style="solid", color="black", weight=3];
3629[label="map toEnum (takeWhile (flip (<=) (Pos (Succ wy107))) (Pos (Succ wy109) - Pos (Succ wy108) + Pos (Succ wy108) : iterate (Pos (Succ wy109) - Pos (Succ wy108) +) (Pos (Succ wy109) - Pos (Succ wy108) + (Pos (Succ wy109) - Pos (Succ wy108) + Pos (Succ wy108)))))\n  Enum a",fontsize=16,color="black",shape="box"];3629 -> 3713[label="",style="solid", color="black", weight=3];
4225[label="toEnum (Pos (Succ wy135)) : map toEnum (takeWhile (flip (>=) (Pos (Succ wy134))) (iterate (Pos (Succ wy136) - Pos (Succ wy135) +) (Pos (Succ wy136) - Pos (Succ wy135) + Pos (Succ wy135))))\n  Enum a",fontsize=16,color="green",shape="box"];4225 -> 4361[label="",style="dashed", color="green", weight=3];
4225 -> 4362[label="",style="dashed", color="green", weight=3];
4226[label="map toEnum (takeWhile0 (flip (>=) (Pos (Succ wy134))) (Pos (Succ wy135)) (iterate (Pos (Succ wy136) - Pos (Succ wy135) +) (Pos (Succ wy136) - Pos (Succ wy135) + Pos (Succ wy135))) True)\n  Enum a",fontsize=16,color="black",shape="box"];4226 -> 4363[label="",style="solid", color="black", weight=3];
3104[label="Pos (Succ wy47)",fontsize=16,color="green",shape="box"];1650[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47)) (iterate (Pos (Succ wy48) - Pos (Succ wy47) +) (Pos (Succ wy48) - Pos (Succ wy47) + (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47)))) (flip (>=) (Pos Zero) (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47))))\n  Enum a",fontsize=16,color="black",shape="box"];1650 -> 1723[label="",style="solid", color="black", weight=3];
1651[label="map toEnum (takeWhile1 (flip (>=) (Neg wy460)) (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47)) (iterate (Pos (Succ wy48) - Pos (Succ wy47) +) (Pos (Succ wy48) - Pos (Succ wy47) + (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47)))) (compare (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47)) (Neg wy460) /= LT))\n  Enum a",fontsize=16,color="black",shape="box"];1651 -> 1724[label="",style="solid", color="black", weight=3];
828[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy500))) (primPlusInt (Pos (Succ wy400) - Pos Zero) (Pos Zero)) (iterate (primPlusInt (Pos (Succ wy400) - Pos Zero)) (primPlusInt (Pos (Succ wy400) - Pos Zero) (primPlusInt (Pos (Succ wy400) - Pos Zero) (Pos Zero)))) (not (primCmpInt (primPlusInt (Pos (Succ wy400) - Pos Zero) (Pos Zero)) (Pos (Succ wy500)) == GT)))",fontsize=16,color="black",shape="box"];828 -> 851[label="",style="solid", color="black", weight=3];
829[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (primPlusInt (primMinusInt (Pos (Succ wy400)) (Pos Zero)) (Pos Zero)) (iterate (primPlusInt (primMinusInt (Pos (Succ wy400)) (Pos Zero))) (primPlusInt (primMinusInt (Pos (Succ wy400)) (Pos Zero)) (primPlusInt (primMinusInt (Pos (Succ wy400)) (Pos Zero)) (Pos Zero)))) (not (primCmpInt (primPlusInt (primMinusInt (Pos (Succ wy400)) (Pos Zero)) (Pos Zero)) (Pos Zero) == GT)))",fontsize=16,color="black",shape="box"];829 -> 852[label="",style="solid", color="black", weight=3];
3013[label="error []",fontsize=16,color="red",shape="box"];2993[label="error []",fontsize=16,color="red",shape="box"];2981[label="error []",fontsize=16,color="red",shape="box"];2992[label="error []",fontsize=16,color="red",shape="box"];3034[label="error []",fontsize=16,color="red",shape="box"];2934[label="error []",fontsize=16,color="red",shape="box"];2974 -> 393[label="",style="dashed", color="red", weight=0];
2974[label="primIntToChar (Pos (Succ wy61))",fontsize=16,color="magenta"];2974 -> 3107[label="",style="dashed", color="magenta", weight=3];
2870[label="error []",fontsize=16,color="red",shape="box"];2909[label="error []",fontsize=16,color="red",shape="box"];1959[label="map toEnum (takeWhile2 (flip (>=) (Pos (Succ wy60))) (Pos Zero - Pos (Succ wy61) + Pos (Succ wy61) : iterate (Pos Zero - Pos (Succ wy61) +) (Pos Zero - Pos (Succ wy61) + (Pos Zero - Pos (Succ wy61) + Pos (Succ wy61)))))\n  Enum a",fontsize=16,color="black",shape="box"];1959 -> 1995[label="",style="solid", color="black", weight=3];
844[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos Zero - Pos (Succ wy300) + Pos (Succ wy300)) (iterate (Pos Zero - Pos (Succ wy300) +) (Pos Zero - Pos (Succ wy300) + (Pos Zero - Pos (Succ wy300) + Pos (Succ wy300)))) (not (compare (Pos Zero - Pos (Succ wy300) + Pos (Succ wy300)) (Pos Zero) == LT)))",fontsize=16,color="black",shape="box"];844 -> 866[label="",style="solid", color="black", weight=3];
845[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy500))) (primPlusInt (primMinusInt (Pos Zero) (Pos Zero)) (Pos Zero)) (iterate (primPlusInt (primMinusInt (Pos Zero) (Pos Zero))) (primPlusInt (primMinusInt (Pos Zero) (Pos Zero)) (primPlusInt (primMinusInt (Pos Zero) (Pos Zero)) (Pos Zero)))) (not (primCmpInt (primPlusInt (primMinusInt (Pos Zero) (Pos Zero)) (Pos Zero)) (Pos (Succ wy500)) == GT)))",fontsize=16,color="black",shape="box"];845 -> 867[label="",style="solid", color="black", weight=3];
846[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (primPlusInt (primMinusNat Zero Zero) (Pos Zero)) (iterate (primPlusInt (primMinusNat Zero Zero)) (primPlusInt (primMinusNat Zero Zero) (primPlusInt (primMinusNat Zero Zero) (Pos Zero)))) (not (primCmpInt (primPlusInt (primMinusNat Zero Zero) (Pos Zero)) (Pos Zero) == GT)))",fontsize=16,color="black",shape="box"];846 -> 868[label="",style="solid", color="black", weight=3];
5465[label="error []",fontsize=16,color="red",shape="box"];5466[label="error []",fontsize=16,color="red",shape="box"];5467[label="error []",fontsize=16,color="red",shape="box"];5468[label="error []",fontsize=16,color="red",shape="box"];5469[label="error []",fontsize=16,color="red",shape="box"];5470[label="error []",fontsize=16,color="red",shape="box"];5471 -> 393[label="",style="dashed", color="red", weight=0];
5471[label="primIntToChar (Pos (Succ wy108))",fontsize=16,color="magenta"];5471 -> 5571[label="",style="dashed", color="magenta", weight=3];
5472[label="error []",fontsize=16,color="red",shape="box"];5473[label="error []",fontsize=16,color="red",shape="box"];3713[label="map toEnum (takeWhile2 (flip (<=) (Pos (Succ wy107))) (Pos (Succ wy109) - Pos (Succ wy108) + Pos (Succ wy108) : iterate (Pos (Succ wy109) - Pos (Succ wy108) +) (Pos (Succ wy109) - Pos (Succ wy108) + (Pos (Succ wy109) - Pos (Succ wy108) + Pos (Succ wy108)))))\n  Enum a",fontsize=16,color="black",shape="box"];3713 -> 3785[label="",style="solid", color="black", weight=3];
4361[label="toEnum (Pos (Succ wy135))\n  Enum a",fontsize=16,color="blue",shape="box"];18433[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];4361 -> 18433[label="",style="solid", color="blue", weight=9];
18433 -> 4509[label="",style="solid", color="blue", weight=3];
18434[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];4361 -> 18434[label="",style="solid", color="blue", weight=9];
18434 -> 4510[label="",style="solid", color="blue", weight=3];
18435[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];4361 -> 18435[label="",style="solid", color="blue", weight=9];
18435 -> 4511[label="",style="solid", color="blue", weight=3];
18436[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];4361 -> 18436[label="",style="solid", color="blue", weight=9];
18436 -> 4512[label="",style="solid", color="blue", weight=3];
18437[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];4361 -> 18437[label="",style="solid", color="blue", weight=9];
18437 -> 4513[label="",style="solid", color="blue", weight=3];
18438[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];4361 -> 18438[label="",style="solid", color="blue", weight=9];
18438 -> 4514[label="",style="solid", color="blue", weight=3];
18439[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];4361 -> 18439[label="",style="solid", color="blue", weight=9];
18439 -> 4515[label="",style="solid", color="blue", weight=3];
18440[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];4361 -> 18440[label="",style="solid", color="blue", weight=9];
18440 -> 4516[label="",style="solid", color="blue", weight=3];
18441[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];4361 -> 18441[label="",style="solid", color="blue", weight=9];
18441 -> 4517[label="",style="solid", color="blue", weight=3];
4362[label="map toEnum (takeWhile (flip (>=) (Pos (Succ wy134))) (iterate (Pos (Succ wy136) - Pos (Succ wy135) +) (Pos (Succ wy136) - Pos (Succ wy135) + Pos (Succ wy135))))\n  Enum a",fontsize=16,color="black",shape="box"];4362 -> 4518[label="",style="solid", color="black", weight=3];
4363 -> 1285[label="",style="dashed", color="red", weight=0];
4363[label="map toEnum []\n  Enum a",fontsize=16,color="magenta"];1723[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47)) (iterate (Pos (Succ wy48) - Pos (Succ wy47) +) (Pos (Succ wy48) - Pos (Succ wy47) + (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47)))) ((>=) Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47) Pos Zero))\n  Enum a",fontsize=16,color="black",shape="box"];1723 -> 1817[label="",style="solid", color="black", weight=3];
1724[label="map toEnum (takeWhile1 (flip (>=) (Neg wy460)) (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47)) (iterate (Pos (Succ wy48) - Pos (Succ wy47) +) (Pos (Succ wy48) - Pos (Succ wy47) + (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47)))) (not (compare (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47)) (Neg wy460) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];1724 -> 1818[label="",style="solid", color="black", weight=3];
851[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy500))) (primPlusInt (primMinusInt (Pos (Succ wy400)) (Pos Zero)) (Pos Zero)) (iterate (primPlusInt (primMinusInt (Pos (Succ wy400)) (Pos Zero))) (primPlusInt (primMinusInt (Pos (Succ wy400)) (Pos Zero)) (primPlusInt (primMinusInt (Pos (Succ wy400)) (Pos Zero)) (Pos Zero)))) (not (primCmpInt (primPlusInt (primMinusInt (Pos (Succ wy400)) (Pos Zero)) (Pos Zero)) (Pos (Succ wy500)) == GT)))",fontsize=16,color="black",shape="box"];851 -> 873[label="",style="solid", color="black", weight=3];
852[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (primPlusInt (primMinusNat (Succ wy400) Zero) (Pos Zero)) (iterate (primPlusInt (primMinusNat (Succ wy400) Zero)) (primPlusInt (primMinusNat (Succ wy400) Zero) (primPlusInt (primMinusNat (Succ wy400) Zero) (Pos Zero)))) (not (primCmpInt (primPlusInt (primMinusNat (Succ wy400) Zero) (Pos Zero)) (Pos Zero) == GT)))",fontsize=16,color="black",shape="box"];852 -> 874[label="",style="solid", color="black", weight=3];
3107[label="Pos (Succ wy61)",fontsize=16,color="green",shape="box"];1995[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy60))) (Pos Zero - Pos (Succ wy61) + Pos (Succ wy61)) (iterate (Pos Zero - Pos (Succ wy61) +) (Pos Zero - Pos (Succ wy61) + (Pos Zero - Pos (Succ wy61) + Pos (Succ wy61)))) (flip (>=) (Pos (Succ wy60)) (Pos Zero - Pos (Succ wy61) + Pos (Succ wy61))))\n  Enum a",fontsize=16,color="black",shape="box"];1995 -> 2087[label="",style="solid", color="black", weight=3];
866[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos Zero - Pos (Succ wy300) + Pos (Succ wy300)) (iterate (Pos Zero - Pos (Succ wy300) +) (Pos Zero - Pos (Succ wy300) + (Pos Zero - Pos (Succ wy300) + Pos (Succ wy300)))) (not (primCmpInt (Pos Zero - Pos (Succ wy300) + Pos (Succ wy300)) (Pos Zero) == LT)))",fontsize=16,color="black",shape="box"];866 -> 887[label="",style="solid", color="black", weight=3];
867[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy500))) (primPlusInt (primMinusNat Zero Zero) (Pos Zero)) (iterate (primPlusInt (primMinusNat Zero Zero)) (primPlusInt (primMinusNat Zero Zero) (primPlusInt (primMinusNat Zero Zero) (Pos Zero)))) (not (primCmpInt (primPlusInt (primMinusNat Zero Zero) (Pos Zero)) (Pos (Succ wy500)) == GT)))",fontsize=16,color="black",shape="box"];867 -> 888[label="",style="solid", color="black", weight=3];
868[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (primPlusInt (Pos Zero) (Pos Zero)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos Zero)))) (not (primCmpInt (primPlusInt (Pos Zero) (Pos Zero)) (Pos Zero) == GT)))",fontsize=16,color="black",shape="triangle"];868 -> 889[label="",style="solid", color="black", weight=3];
5571[label="Pos (Succ wy108)",fontsize=16,color="green",shape="box"];3785[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy107))) (Pos (Succ wy109) - Pos (Succ wy108) + Pos (Succ wy108)) (iterate (Pos (Succ wy109) - Pos (Succ wy108) +) (Pos (Succ wy109) - Pos (Succ wy108) + (Pos (Succ wy109) - Pos (Succ wy108) + Pos (Succ wy108)))) (flip (<=) (Pos (Succ wy107)) (Pos (Succ wy109) - Pos (Succ wy108) + Pos (Succ wy108))))\n  Enum a",fontsize=16,color="black",shape="box"];3785 -> 3889[label="",style="solid", color="black", weight=3];
4509[label="toEnum (Pos (Succ wy135))",fontsize=16,color="black",shape="box"];4509 -> 5474[label="",style="solid", color="black", weight=3];
4510[label="toEnum (Pos (Succ wy135))\n  Integral a",fontsize=16,color="black",shape="box"];4510 -> 5475[label="",style="solid", color="black", weight=3];
4511[label="toEnum (Pos (Succ wy135))",fontsize=16,color="black",shape="box"];4511 -> 5476[label="",style="solid", color="black", weight=3];
4512[label="toEnum (Pos (Succ wy135))",fontsize=16,color="black",shape="box"];4512 -> 5477[label="",style="solid", color="black", weight=3];
4513[label="toEnum (Pos (Succ wy135))",fontsize=16,color="black",shape="box"];4513 -> 5478[label="",style="solid", color="black", weight=3];
4514[label="toEnum (Pos (Succ wy135))",fontsize=16,color="black",shape="box"];4514 -> 5479[label="",style="solid", color="black", weight=3];
4515[label="toEnum (Pos (Succ wy135))",fontsize=16,color="black",shape="box"];4515 -> 5480[label="",style="solid", color="black", weight=3];
4516[label="toEnum (Pos (Succ wy135))",fontsize=16,color="black",shape="box"];4516 -> 5481[label="",style="solid", color="black", weight=3];
4517[label="toEnum (Pos (Succ wy135))",fontsize=16,color="black",shape="box"];4517 -> 5482[label="",style="solid", color="black", weight=3];
4518[label="map toEnum (takeWhile (flip (>=) (Pos (Succ wy134))) (Pos (Succ wy136) - Pos (Succ wy135) + Pos (Succ wy135) : iterate (Pos (Succ wy136) - Pos (Succ wy135) +) (Pos (Succ wy136) - Pos (Succ wy135) + (Pos (Succ wy136) - Pos (Succ wy135) + Pos (Succ wy135)))))\n  Enum a",fontsize=16,color="black",shape="box"];4518 -> 4544[label="",style="solid", color="black", weight=3];
1817[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47)) (iterate (Pos (Succ wy48) - Pos (Succ wy47) +) (Pos (Succ wy48) - Pos (Succ wy47) + (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47)))) (compare (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47)) (Pos Zero) /= LT))\n  Enum a",fontsize=16,color="black",shape="box"];1817 -> 1901[label="",style="solid", color="black", weight=3];
1818[label="map toEnum (takeWhile1 (flip (>=) (Neg wy460)) (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47)) (iterate (Pos (Succ wy48) - Pos (Succ wy47) +) (Pos (Succ wy48) - Pos (Succ wy47) + (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47)))) (not (primCmpInt (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47)) (Neg wy460) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];1818 -> 1902[label="",style="solid", color="black", weight=3];
873[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy500))) (primPlusInt (primMinusNat (Succ wy400) Zero) (Pos Zero)) (iterate (primPlusInt (primMinusNat (Succ wy400) Zero)) (primPlusInt (primMinusNat (Succ wy400) Zero) (primPlusInt (primMinusNat (Succ wy400) Zero) (Pos Zero)))) (not (primCmpInt (primPlusInt (primMinusNat (Succ wy400) Zero) (Pos Zero)) (Pos (Succ wy500)) == GT)))",fontsize=16,color="black",shape="box"];873 -> 895[label="",style="solid", color="black", weight=3];
874[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (primPlusInt (Pos (Succ wy400)) (Pos Zero)) (iterate (primPlusInt (Pos (Succ wy400))) (primPlusInt (Pos (Succ wy400)) (primPlusInt (Pos (Succ wy400)) (Pos Zero)))) (not (primCmpInt (primPlusInt (Pos (Succ wy400)) (Pos Zero)) (Pos Zero) == GT)))",fontsize=16,color="black",shape="box"];874 -> 896[label="",style="solid", color="black", weight=3];
2087[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy60))) (Pos Zero - Pos (Succ wy61) + Pos (Succ wy61)) (iterate (Pos Zero - Pos (Succ wy61) +) (Pos Zero - Pos (Succ wy61) + (Pos Zero - Pos (Succ wy61) + Pos (Succ wy61)))) ((>=) Pos Zero - Pos (Succ wy61) + Pos (Succ wy61) Pos (Succ wy60)))\n  Enum a",fontsize=16,color="black",shape="box"];2087 -> 2149[label="",style="solid", color="black", weight=3];
887[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Pos Zero - Pos (Succ wy300)) (Pos (Succ wy300))) (iterate (primPlusInt (Pos Zero - Pos (Succ wy300))) (primPlusInt (Pos Zero - Pos (Succ wy300)) (primPlusInt (Pos Zero - Pos (Succ wy300)) (Pos (Succ wy300))))) (not (primCmpInt (primPlusInt (Pos Zero - Pos (Succ wy300)) (Pos (Succ wy300))) (Pos Zero) == LT)))",fontsize=16,color="black",shape="box"];887 -> 913[label="",style="solid", color="black", weight=3];
888[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy500))) (primPlusInt (Pos Zero) (Pos Zero)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos Zero)))) (not (primCmpInt (primPlusInt (Pos Zero) (Pos Zero)) (Pos (Succ wy500)) == GT)))",fontsize=16,color="black",shape="triangle"];888 -> 914[label="",style="solid", color="black", weight=3];
889[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (Pos (primPlusNat Zero Zero)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos (primPlusNat Zero Zero)))) (not (primCmpInt (Pos (primPlusNat Zero Zero)) (Pos Zero) == GT)))",fontsize=16,color="black",shape="box"];889 -> 915[label="",style="solid", color="black", weight=3];
3889[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy107))) (Pos (Succ wy109) - Pos (Succ wy108) + Pos (Succ wy108)) (iterate (Pos (Succ wy109) - Pos (Succ wy108) +) (Pos (Succ wy109) - Pos (Succ wy108) + (Pos (Succ wy109) - Pos (Succ wy108) + Pos (Succ wy108)))) ((<=) Pos (Succ wy109) - Pos (Succ wy108) + Pos (Succ wy108) Pos (Succ wy107)))\n  Enum a",fontsize=16,color="black",shape="box"];3889 -> 3994[label="",style="solid", color="black", weight=3];
5474[label="error []",fontsize=16,color="red",shape="box"];5475[label="error []",fontsize=16,color="red",shape="box"];5476[label="error []",fontsize=16,color="red",shape="box"];5477[label="error []",fontsize=16,color="red",shape="box"];5478[label="error []",fontsize=16,color="red",shape="box"];5479[label="error []",fontsize=16,color="red",shape="box"];5480 -> 393[label="",style="dashed", color="red", weight=0];
5480[label="primIntToChar (Pos (Succ wy135))",fontsize=16,color="magenta"];5480 -> 5572[label="",style="dashed", color="magenta", weight=3];
5481[label="error []",fontsize=16,color="red",shape="box"];5482[label="error []",fontsize=16,color="red",shape="box"];4544[label="map toEnum (takeWhile2 (flip (>=) (Pos (Succ wy134))) (Pos (Succ wy136) - Pos (Succ wy135) + Pos (Succ wy135) : iterate (Pos (Succ wy136) - Pos (Succ wy135) +) (Pos (Succ wy136) - Pos (Succ wy135) + (Pos (Succ wy136) - Pos (Succ wy135) + Pos (Succ wy135)))))\n  Enum a",fontsize=16,color="black",shape="box"];4544 -> 4679[label="",style="solid", color="black", weight=3];
1901[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47)) (iterate (Pos (Succ wy48) - Pos (Succ wy47) +) (Pos (Succ wy48) - Pos (Succ wy47) + (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47)))) (not (compare (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47)) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];1901 -> 1982[label="",style="solid", color="black", weight=3];
1902[label="map toEnum (takeWhile1 (flip (>=) (Neg wy460)) (primPlusInt (Pos (Succ wy48) - Pos (Succ wy47)) (Pos (Succ wy47))) (iterate (primPlusInt (Pos (Succ wy48) - Pos (Succ wy47))) (primPlusInt (Pos (Succ wy48) - Pos (Succ wy47)) (primPlusInt (Pos (Succ wy48) - Pos (Succ wy47)) (Pos (Succ wy47))))) (not (primCmpInt (primPlusInt (Pos (Succ wy48) - Pos (Succ wy47)) (Pos (Succ wy47))) (Neg wy460) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];1902 -> 1983[label="",style="solid", color="black", weight=3];
895[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy500))) (primPlusInt (Pos (Succ wy400)) (Pos Zero)) (iterate (primPlusInt (Pos (Succ wy400))) (primPlusInt (Pos (Succ wy400)) (primPlusInt (Pos (Succ wy400)) (Pos Zero)))) (not (primCmpInt (primPlusInt (Pos (Succ wy400)) (Pos Zero)) (Pos (Succ wy500)) == GT)))",fontsize=16,color="black",shape="box"];895 -> 918[label="",style="solid", color="black", weight=3];
896[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (Pos (primPlusNat (Succ wy400) Zero)) (iterate (primPlusInt (Pos (Succ wy400))) (primPlusInt (Pos (Succ wy400)) (Pos (primPlusNat (Succ wy400) Zero)))) (not (primCmpInt (Pos (primPlusNat (Succ wy400) Zero)) (Pos Zero) == GT)))",fontsize=16,color="black",shape="box"];896 -> 919[label="",style="solid", color="black", weight=3];
2149[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy60))) (Pos Zero - Pos (Succ wy61) + Pos (Succ wy61)) (iterate (Pos Zero - Pos (Succ wy61) +) (Pos Zero - Pos (Succ wy61) + (Pos Zero - Pos (Succ wy61) + Pos (Succ wy61)))) (compare (Pos Zero - Pos (Succ wy61) + Pos (Succ wy61)) (Pos (Succ wy60)) /= LT))\n  Enum a",fontsize=16,color="black",shape="box"];2149 -> 2221[label="",style="solid", color="black", weight=3];
913[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (primMinusInt (Pos Zero) (Pos (Succ wy300))) (Pos (Succ wy300))) (iterate (primPlusInt (primMinusInt (Pos Zero) (Pos (Succ wy300)))) (primPlusInt (primMinusInt (Pos Zero) (Pos (Succ wy300))) (primPlusInt (primMinusInt (Pos Zero) (Pos (Succ wy300))) (Pos (Succ wy300))))) (not (primCmpInt (primPlusInt (primMinusInt (Pos Zero) (Pos (Succ wy300))) (Pos (Succ wy300))) (Pos Zero) == LT)))",fontsize=16,color="black",shape="box"];913 -> 935[label="",style="solid", color="black", weight=3];
914 -> 5580[label="",style="dashed", color="red", weight=0];
914[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy500))) (Pos (primPlusNat Zero Zero)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos (primPlusNat Zero Zero)))) (not (primCmpInt (Pos (primPlusNat Zero Zero)) (Pos (Succ wy500)) == GT)))",fontsize=16,color="magenta"];914 -> 5581[label="",style="dashed", color="magenta", weight=3];
914 -> 5582[label="",style="dashed", color="magenta", weight=3];
914 -> 5583[label="",style="dashed", color="magenta", weight=3];
914 -> 5584[label="",style="dashed", color="magenta", weight=3];
915[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (Pos Zero) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos Zero))) (not (primCmpInt (Pos Zero) (Pos Zero) == GT)))",fontsize=16,color="black",shape="box"];915 -> 937[label="",style="solid", color="black", weight=3];
3994[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy107))) (Pos (Succ wy109) - Pos (Succ wy108) + Pos (Succ wy108)) (iterate (Pos (Succ wy109) - Pos (Succ wy108) +) (Pos (Succ wy109) - Pos (Succ wy108) + (Pos (Succ wy109) - Pos (Succ wy108) + Pos (Succ wy108)))) (compare (Pos (Succ wy109) - Pos (Succ wy108) + Pos (Succ wy108)) (Pos (Succ wy107)) /= GT))\n  Enum a",fontsize=16,color="black",shape="box"];3994 -> 4116[label="",style="solid", color="black", weight=3];
5572[label="Pos (Succ wy135)",fontsize=16,color="green",shape="box"];4679[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy134))) (Pos (Succ wy136) - Pos (Succ wy135) + Pos (Succ wy135)) (iterate (Pos (Succ wy136) - Pos (Succ wy135) +) (Pos (Succ wy136) - Pos (Succ wy135) + (Pos (Succ wy136) - Pos (Succ wy135) + Pos (Succ wy135)))) (flip (>=) (Pos (Succ wy134)) (Pos (Succ wy136) - Pos (Succ wy135) + Pos (Succ wy135))))\n  Enum a",fontsize=16,color="black",shape="box"];4679 -> 4830[label="",style="solid", color="black", weight=3];
1982[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47)) (iterate (Pos (Succ wy48) - Pos (Succ wy47) +) (Pos (Succ wy48) - Pos (Succ wy47) + (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47)))) (not (primCmpInt (Pos (Succ wy48) - Pos (Succ wy47) + Pos (Succ wy47)) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];1982 -> 2059[label="",style="solid", color="black", weight=3];
1983[label="map toEnum (takeWhile1 (flip (>=) (Neg wy460)) (primPlusInt (primMinusInt (Pos (Succ wy48)) (Pos (Succ wy47))) (Pos (Succ wy47))) (iterate (primPlusInt (primMinusInt (Pos (Succ wy48)) (Pos (Succ wy47)))) (primPlusInt (primMinusInt (Pos (Succ wy48)) (Pos (Succ wy47))) (primPlusInt (primMinusInt (Pos (Succ wy48)) (Pos (Succ wy47))) (Pos (Succ wy47))))) (not (primCmpInt (primPlusInt (primMinusInt (Pos (Succ wy48)) (Pos (Succ wy47))) (Pos (Succ wy47))) (Neg wy460) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];1983 -> 2060[label="",style="solid", color="black", weight=3];
918 -> 5492[label="",style="dashed", color="red", weight=0];
918[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy500))) (Pos (primPlusNat (Succ wy400) Zero)) (iterate (primPlusInt (Pos (Succ wy400))) (primPlusInt (Pos (Succ wy400)) (Pos (primPlusNat (Succ wy400) Zero)))) (not (primCmpInt (Pos (primPlusNat (Succ wy400) Zero)) (Pos (Succ wy500)) == GT)))",fontsize=16,color="magenta"];918 -> 5493[label="",style="dashed", color="magenta", weight=3];
918 -> 5494[label="",style="dashed", color="magenta", weight=3];
918 -> 5495[label="",style="dashed", color="magenta", weight=3];
918 -> 5496[label="",style="dashed", color="magenta", weight=3];
918 -> 5497[label="",style="dashed", color="magenta", weight=3];
919[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (Pos (Succ wy400)) (iterate (primPlusInt (Pos (Succ wy400))) (primPlusInt (Pos (Succ wy400)) (Pos (Succ wy400)))) (not (primCmpInt (Pos (Succ wy400)) (Pos Zero) == GT)))",fontsize=16,color="black",shape="box"];919 -> 941[label="",style="solid", color="black", weight=3];
2221[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy60))) (Pos Zero - Pos (Succ wy61) + Pos (Succ wy61)) (iterate (Pos Zero - Pos (Succ wy61) +) (Pos Zero - Pos (Succ wy61) + (Pos Zero - Pos (Succ wy61) + Pos (Succ wy61)))) (not (compare (Pos Zero - Pos (Succ wy61) + Pos (Succ wy61)) (Pos (Succ wy60)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];2221 -> 2283[label="",style="solid", color="black", weight=3];
935 -> 6196[label="",style="dashed", color="red", weight=0];
935[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (primMinusNat Zero (Succ wy300)) (Pos (Succ wy300))) (iterate (primPlusInt (primMinusNat Zero (Succ wy300))) (primPlusInt (primMinusNat Zero (Succ wy300)) (primPlusInt (primMinusNat Zero (Succ wy300)) (Pos (Succ wy300))))) (not (primCmpInt (primPlusInt (primMinusNat Zero (Succ wy300)) (Pos (Succ wy300))) (Pos Zero) == LT)))",fontsize=16,color="magenta"];935 -> 6197[label="",style="dashed", color="magenta", weight=3];
935 -> 6198[label="",style="dashed", color="magenta", weight=3];
935 -> 6199[label="",style="dashed", color="magenta", weight=3];
5581 -> 3248[label="",style="dashed", color="red", weight=0];
5581[label="primPlusNat Zero Zero",fontsize=16,color="magenta"];5581 -> 5592[label="",style="dashed", color="magenta", weight=3];
5582 -> 3248[label="",style="dashed", color="red", weight=0];
5582[label="primPlusNat Zero Zero",fontsize=16,color="magenta"];5582 -> 5593[label="",style="dashed", color="magenta", weight=3];
5583[label="wy500",fontsize=16,color="green",shape="box"];5584 -> 3248[label="",style="dashed", color="red", weight=0];
5584[label="primPlusNat Zero Zero",fontsize=16,color="magenta"];5584 -> 5594[label="",style="dashed", color="magenta", weight=3];
5580[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy107))) (Pos wy180) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy181))) (not (primCmpInt (Pos wy182) (Pos (Succ wy107)) == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];18450[label="wy182/Succ wy1820",fontsize=10,color="white",style="solid",shape="box"];5580 -> 18450[label="",style="solid", color="burlywood", weight=9];
18450 -> 5595[label="",style="solid", color="burlywood", weight=3];
18451[label="wy182/Zero",fontsize=10,color="white",style="solid",shape="box"];5580 -> 18451[label="",style="solid", color="burlywood", weight=9];
18451 -> 5596[label="",style="solid", color="burlywood", weight=3];
937[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (Pos Zero) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos Zero))) (not (EQ == GT)))",fontsize=16,color="black",shape="box"];937 -> 958[label="",style="solid", color="black", weight=3];
4116[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy107))) (Pos (Succ wy109) - Pos (Succ wy108) + Pos (Succ wy108)) (iterate (Pos (Succ wy109) - Pos (Succ wy108) +) (Pos (Succ wy109) - Pos (Succ wy108) + (Pos (Succ wy109) - Pos (Succ wy108) + Pos (Succ wy108)))) (not (compare (Pos (Succ wy109) - Pos (Succ wy108) + Pos (Succ wy108)) (Pos (Succ wy107)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];4116 -> 4227[label="",style="solid", color="black", weight=3];
4830[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy134))) (Pos (Succ wy136) - Pos (Succ wy135) + Pos (Succ wy135)) (iterate (Pos (Succ wy136) - Pos (Succ wy135) +) (Pos (Succ wy136) - Pos (Succ wy135) + (Pos (Succ wy136) - Pos (Succ wy135) + Pos (Succ wy135)))) ((>=) Pos (Succ wy136) - Pos (Succ wy135) + Pos (Succ wy135) Pos (Succ wy134)))\n  Enum a",fontsize=16,color="black",shape="box"];4830 -> 4981[label="",style="solid", color="black", weight=3];
2059[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Pos (Succ wy48) - Pos (Succ wy47)) (Pos (Succ wy47))) (iterate (primPlusInt (Pos (Succ wy48) - Pos (Succ wy47))) (primPlusInt (Pos (Succ wy48) - Pos (Succ wy47)) (primPlusInt (Pos (Succ wy48) - Pos (Succ wy47)) (Pos (Succ wy47))))) (not (primCmpInt (primPlusInt (Pos (Succ wy48) - Pos (Succ wy47)) (Pos (Succ wy47))) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];2059 -> 2136[label="",style="solid", color="black", weight=3];
2060 -> 6006[label="",style="dashed", color="red", weight=0];
2060[label="map toEnum (takeWhile1 (flip (>=) (Neg wy460)) (primPlusInt (primMinusNat (Succ wy48) (Succ wy47)) (Pos (Succ wy47))) (iterate (primPlusInt (primMinusNat (Succ wy48) (Succ wy47))) (primPlusInt (primMinusNat (Succ wy48) (Succ wy47)) (primPlusInt (primMinusNat (Succ wy48) (Succ wy47)) (Pos (Succ wy47))))) (not (primCmpInt (primPlusInt (primMinusNat (Succ wy48) (Succ wy47)) (Pos (Succ wy47))) (Neg wy460) == LT)))\n  Enum a",fontsize=16,color="magenta"];2060 -> 6007[label="",style="dashed", color="magenta", weight=3];
2060 -> 6008[label="",style="dashed", color="magenta", weight=3];
2060 -> 6009[label="",style="dashed", color="magenta", weight=3];
2060 -> 6010[label="",style="dashed", color="magenta", weight=3];
5493 -> 3248[label="",style="dashed", color="red", weight=0];
5493[label="primPlusNat (Succ wy400) Zero",fontsize=16,color="magenta"];5493 -> 5573[label="",style="dashed", color="magenta", weight=3];
5494[label="wy400",fontsize=16,color="green",shape="box"];5495[label="wy500",fontsize=16,color="green",shape="box"];5496 -> 3248[label="",style="dashed", color="red", weight=0];
5496[label="primPlusNat (Succ wy400) Zero",fontsize=16,color="magenta"];5496 -> 5574[label="",style="dashed", color="magenta", weight=3];
5497 -> 3248[label="",style="dashed", color="red", weight=0];
5497[label="primPlusNat (Succ wy400) Zero",fontsize=16,color="magenta"];5497 -> 5575[label="",style="dashed", color="magenta", weight=3];
5492[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy107))) (Pos wy177) (iterate (primPlusInt (Pos (Succ wy1090))) (primPlusInt (Pos (Succ wy1090)) (Pos wy178))) (not (primCmpInt (Pos wy179) (Pos (Succ wy107)) == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];18456[label="wy179/Succ wy1790",fontsize=10,color="white",style="solid",shape="box"];5492 -> 18456[label="",style="solid", color="burlywood", weight=9];
18456 -> 5576[label="",style="solid", color="burlywood", weight=3];
18457[label="wy179/Zero",fontsize=10,color="white",style="solid",shape="box"];5492 -> 18457[label="",style="solid", color="burlywood", weight=9];
18457 -> 5577[label="",style="solid", color="burlywood", weight=3];
941[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (Pos (Succ wy400)) (iterate (primPlusInt (Pos (Succ wy400))) (primPlusInt (Pos (Succ wy400)) (Pos (Succ wy400)))) (not (primCmpNat (Succ wy400) Zero == GT)))",fontsize=16,color="black",shape="box"];941 -> 962[label="",style="solid", color="black", weight=3];
2283[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy60))) (Pos Zero - Pos (Succ wy61) + Pos (Succ wy61)) (iterate (Pos Zero - Pos (Succ wy61) +) (Pos Zero - Pos (Succ wy61) + (Pos Zero - Pos (Succ wy61) + Pos (Succ wy61)))) (not (primCmpInt (Pos Zero - Pos (Succ wy61) + Pos (Succ wy61)) (Pos (Succ wy60)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];2283 -> 2337[label="",style="solid", color="black", weight=3];
6197[label="Zero",fontsize=16,color="green",shape="box"];6198[label="wy300",fontsize=16,color="green",shape="box"];6199[label="Succ wy300",fontsize=16,color="green",shape="box"];6196[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (primMinusNat wy192 wy193) (Pos (Succ wy194))) (iterate (primPlusInt (primMinusNat wy192 wy193)) (primPlusInt (primMinusNat wy192 wy193) (primPlusInt (primMinusNat wy192 wy193) (Pos (Succ wy194))))) (not (primCmpInt (primPlusInt (primMinusNat wy192 wy193) (Pos (Succ wy194))) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];18458[label="wy192/Succ wy1920",fontsize=10,color="white",style="solid",shape="box"];6196 -> 18458[label="",style="solid", color="burlywood", weight=9];
18458 -> 6230[label="",style="solid", color="burlywood", weight=3];
18459[label="wy192/Zero",fontsize=10,color="white",style="solid",shape="box"];6196 -> 18459[label="",style="solid", color="burlywood", weight=9];
18459 -> 6231[label="",style="solid", color="burlywood", weight=3];
5592[label="Zero",fontsize=16,color="green",shape="box"];3248[label="primPlusNat wy480 Zero",fontsize=16,color="burlywood",shape="triangle"];18460[label="wy480/Succ wy4800",fontsize=10,color="white",style="solid",shape="box"];3248 -> 18460[label="",style="solid", color="burlywood", weight=9];
18460 -> 3342[label="",style="solid", color="burlywood", weight=3];
18461[label="wy480/Zero",fontsize=10,color="white",style="solid",shape="box"];3248 -> 18461[label="",style="solid", color="burlywood", weight=9];
18461 -> 3343[label="",style="solid", color="burlywood", weight=3];
5593[label="Zero",fontsize=16,color="green",shape="box"];5594[label="Zero",fontsize=16,color="green",shape="box"];5595[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy107))) (Pos wy180) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy181))) (not (primCmpInt (Pos (Succ wy1820)) (Pos (Succ wy107)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];5595 -> 5886[label="",style="solid", color="black", weight=3];
5596[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy107))) (Pos wy180) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy181))) (not (primCmpInt (Pos Zero) (Pos (Succ wy107)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];5596 -> 5887[label="",style="solid", color="black", weight=3];
958[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (Pos Zero) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos Zero))) (not False))",fontsize=16,color="black",shape="box"];958 -> 983[label="",style="solid", color="black", weight=3];
4227[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy107))) (Pos (Succ wy109) - Pos (Succ wy108) + Pos (Succ wy108)) (iterate (Pos (Succ wy109) - Pos (Succ wy108) +) (Pos (Succ wy109) - Pos (Succ wy108) + (Pos (Succ wy109) - Pos (Succ wy108) + Pos (Succ wy108)))) (not (primCmpInt (Pos (Succ wy109) - Pos (Succ wy108) + Pos (Succ wy108)) (Pos (Succ wy107)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];4227 -> 4364[label="",style="solid", color="black", weight=3];
4981[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy134))) (Pos (Succ wy136) - Pos (Succ wy135) + Pos (Succ wy135)) (iterate (Pos (Succ wy136) - Pos (Succ wy135) +) (Pos (Succ wy136) - Pos (Succ wy135) + (Pos (Succ wy136) - Pos (Succ wy135) + Pos (Succ wy135)))) (compare (Pos (Succ wy136) - Pos (Succ wy135) + Pos (Succ wy135)) (Pos (Succ wy134)) /= LT))\n  Enum a",fontsize=16,color="black",shape="box"];4981 -> 5021[label="",style="solid", color="black", weight=3];
2136[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (primMinusInt (Pos (Succ wy48)) (Pos (Succ wy47))) (Pos (Succ wy47))) (iterate (primPlusInt (primMinusInt (Pos (Succ wy48)) (Pos (Succ wy47)))) (primPlusInt (primMinusInt (Pos (Succ wy48)) (Pos (Succ wy47))) (primPlusInt (primMinusInt (Pos (Succ wy48)) (Pos (Succ wy47))) (Pos (Succ wy47))))) (not (primCmpInt (primPlusInt (primMinusInt (Pos (Succ wy48)) (Pos (Succ wy47))) (Pos (Succ wy47))) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];2136 -> 2181[label="",style="solid", color="black", weight=3];
6007[label="wy460",fontsize=16,color="green",shape="box"];6008[label="wy47",fontsize=16,color="green",shape="box"];6009[label="Succ wy47",fontsize=16,color="green",shape="box"];6010[label="Succ wy48",fontsize=16,color="green",shape="box"];6006[label="map toEnum (takeWhile1 (flip (>=) (Neg wy187)) (primPlusInt (primMinusNat wy188 wy189) (Pos (Succ wy190))) (iterate (primPlusInt (primMinusNat wy188 wy189)) (primPlusInt (primMinusNat wy188 wy189) (primPlusInt (primMinusNat wy188 wy189) (Pos (Succ wy190))))) (not (primCmpInt (primPlusInt (primMinusNat wy188 wy189) (Pos (Succ wy190))) (Neg wy187) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];18462[label="wy188/Succ wy1880",fontsize=10,color="white",style="solid",shape="box"];6006 -> 18462[label="",style="solid", color="burlywood", weight=9];
18462 -> 6047[label="",style="solid", color="burlywood", weight=3];
18463[label="wy188/Zero",fontsize=10,color="white",style="solid",shape="box"];6006 -> 18463[label="",style="solid", color="burlywood", weight=9];
18463 -> 6048[label="",style="solid", color="burlywood", weight=3];
5573[label="Succ wy400",fontsize=16,color="green",shape="box"];5574[label="Succ wy400",fontsize=16,color="green",shape="box"];5575[label="Succ wy400",fontsize=16,color="green",shape="box"];5576[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy107))) (Pos wy177) (iterate (primPlusInt (Pos (Succ wy1090))) (primPlusInt (Pos (Succ wy1090)) (Pos wy178))) (not (primCmpInt (Pos (Succ wy1790)) (Pos (Succ wy107)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];5576 -> 5597[label="",style="solid", color="black", weight=3];
5577[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy107))) (Pos wy177) (iterate (primPlusInt (Pos (Succ wy1090))) (primPlusInt (Pos (Succ wy1090)) (Pos wy178))) (not (primCmpInt (Pos Zero) (Pos (Succ wy107)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];5577 -> 5598[label="",style="solid", color="black", weight=3];
962[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (Pos (Succ wy400)) (iterate (primPlusInt (Pos (Succ wy400))) (primPlusInt (Pos (Succ wy400)) (Pos (Succ wy400)))) (not (GT == GT)))",fontsize=16,color="black",shape="box"];962 -> 987[label="",style="solid", color="black", weight=3];
2337[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy60))) (primPlusInt (Pos Zero - Pos (Succ wy61)) (Pos (Succ wy61))) (iterate (primPlusInt (Pos Zero - Pos (Succ wy61))) (primPlusInt (Pos Zero - Pos (Succ wy61)) (primPlusInt (Pos Zero - Pos (Succ wy61)) (Pos (Succ wy61))))) (not (primCmpInt (primPlusInt (Pos Zero - Pos (Succ wy61)) (Pos (Succ wy61))) (Pos (Succ wy60)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];2337 -> 2422[label="",style="solid", color="black", weight=3];
6230[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (primMinusNat (Succ wy1920) wy193) (Pos (Succ wy194))) (iterate (primPlusInt (primMinusNat (Succ wy1920) wy193)) (primPlusInt (primMinusNat (Succ wy1920) wy193) (primPlusInt (primMinusNat (Succ wy1920) wy193) (Pos (Succ wy194))))) (not (primCmpInt (primPlusInt (primMinusNat (Succ wy1920) wy193) (Pos (Succ wy194))) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];18464[label="wy193/Succ wy1930",fontsize=10,color="white",style="solid",shape="box"];6230 -> 18464[label="",style="solid", color="burlywood", weight=9];
18464 -> 6264[label="",style="solid", color="burlywood", weight=3];
18465[label="wy193/Zero",fontsize=10,color="white",style="solid",shape="box"];6230 -> 18465[label="",style="solid", color="burlywood", weight=9];
18465 -> 6265[label="",style="solid", color="burlywood", weight=3];
6231[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (primMinusNat Zero wy193) (Pos (Succ wy194))) (iterate (primPlusInt (primMinusNat Zero wy193)) (primPlusInt (primMinusNat Zero wy193) (primPlusInt (primMinusNat Zero wy193) (Pos (Succ wy194))))) (not (primCmpInt (primPlusInt (primMinusNat Zero wy193) (Pos (Succ wy194))) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];18466[label="wy193/Succ wy1930",fontsize=10,color="white",style="solid",shape="box"];6231 -> 18466[label="",style="solid", color="burlywood", weight=9];
18466 -> 6266[label="",style="solid", color="burlywood", weight=3];
18467[label="wy193/Zero",fontsize=10,color="white",style="solid",shape="box"];6231 -> 18467[label="",style="solid", color="burlywood", weight=9];
18467 -> 6267[label="",style="solid", color="burlywood", weight=3];
3342[label="primPlusNat (Succ wy4800) Zero",fontsize=16,color="black",shape="box"];3342 -> 3361[label="",style="solid", color="black", weight=3];
3343[label="primPlusNat Zero Zero",fontsize=16,color="black",shape="box"];3343 -> 3362[label="",style="solid", color="black", weight=3];
5886 -> 10066[label="",style="dashed", color="red", weight=0];
5886[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy107))) (Pos wy180) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy181))) (not (primCmpNat (Succ wy1820) (Succ wy107) == GT)))\n  Enum a",fontsize=16,color="magenta"];5886 -> 10067[label="",style="dashed", color="magenta", weight=3];
5886 -> 10068[label="",style="dashed", color="magenta", weight=3];
5886 -> 10069[label="",style="dashed", color="magenta", weight=3];
5886 -> 10070[label="",style="dashed", color="magenta", weight=3];
5886 -> 10071[label="",style="dashed", color="magenta", weight=3];
5887 -> 10066[label="",style="dashed", color="red", weight=0];
5887[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy107))) (Pos wy180) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy181))) (not (primCmpNat Zero (Succ wy107) == GT)))\n  Enum a",fontsize=16,color="magenta"];5887 -> 10072[label="",style="dashed", color="magenta", weight=3];
5887 -> 10073[label="",style="dashed", color="magenta", weight=3];
5887 -> 10074[label="",style="dashed", color="magenta", weight=3];
5887 -> 10075[label="",style="dashed", color="magenta", weight=3];
5887 -> 10076[label="",style="dashed", color="magenta", weight=3];
983[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (Pos Zero) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos Zero))) True)",fontsize=16,color="black",shape="box"];983 -> 1007[label="",style="solid", color="black", weight=3];
4364[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy107))) (primPlusInt (Pos (Succ wy109) - Pos (Succ wy108)) (Pos (Succ wy108))) (iterate (primPlusInt (Pos (Succ wy109) - Pos (Succ wy108))) (primPlusInt (Pos (Succ wy109) - Pos (Succ wy108)) (primPlusInt (Pos (Succ wy109) - Pos (Succ wy108)) (Pos (Succ wy108))))) (not (primCmpInt (primPlusInt (Pos (Succ wy109) - Pos (Succ wy108)) (Pos (Succ wy108))) (Pos (Succ wy107)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];4364 -> 4519[label="",style="solid", color="black", weight=3];
5021[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy134))) (Pos (Succ wy136) - Pos (Succ wy135) + Pos (Succ wy135)) (iterate (Pos (Succ wy136) - Pos (Succ wy135) +) (Pos (Succ wy136) - Pos (Succ wy135) + (Pos (Succ wy136) - Pos (Succ wy135) + Pos (Succ wy135)))) (not (compare (Pos (Succ wy136) - Pos (Succ wy135) + Pos (Succ wy135)) (Pos (Succ wy134)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];5021 -> 5397[label="",style="solid", color="black", weight=3];
2181 -> 6196[label="",style="dashed", color="red", weight=0];
2181[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (primMinusNat (Succ wy48) (Succ wy47)) (Pos (Succ wy47))) (iterate (primPlusInt (primMinusNat (Succ wy48) (Succ wy47))) (primPlusInt (primMinusNat (Succ wy48) (Succ wy47)) (primPlusInt (primMinusNat (Succ wy48) (Succ wy47)) (Pos (Succ wy47))))) (not (primCmpInt (primPlusInt (primMinusNat (Succ wy48) (Succ wy47)) (Pos (Succ wy47))) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="magenta"];2181 -> 6200[label="",style="dashed", color="magenta", weight=3];
2181 -> 6201[label="",style="dashed", color="magenta", weight=3];
2181 -> 6202[label="",style="dashed", color="magenta", weight=3];
6047[label="map toEnum (takeWhile1 (flip (>=) (Neg wy187)) (primPlusInt (primMinusNat (Succ wy1880) wy189) (Pos (Succ wy190))) (iterate (primPlusInt (primMinusNat (Succ wy1880) wy189)) (primPlusInt (primMinusNat (Succ wy1880) wy189) (primPlusInt (primMinusNat (Succ wy1880) wy189) (Pos (Succ wy190))))) (not (primCmpInt (primPlusInt (primMinusNat (Succ wy1880) wy189) (Pos (Succ wy190))) (Neg wy187) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];18471[label="wy189/Succ wy1890",fontsize=10,color="white",style="solid",shape="box"];6047 -> 18471[label="",style="solid", color="burlywood", weight=9];
18471 -> 6151[label="",style="solid", color="burlywood", weight=3];
18472[label="wy189/Zero",fontsize=10,color="white",style="solid",shape="box"];6047 -> 18472[label="",style="solid", color="burlywood", weight=9];
18472 -> 6152[label="",style="solid", color="burlywood", weight=3];
6048[label="map toEnum (takeWhile1 (flip (>=) (Neg wy187)) (primPlusInt (primMinusNat Zero wy189) (Pos (Succ wy190))) (iterate (primPlusInt (primMinusNat Zero wy189)) (primPlusInt (primMinusNat Zero wy189) (primPlusInt (primMinusNat Zero wy189) (Pos (Succ wy190))))) (not (primCmpInt (primPlusInt (primMinusNat Zero wy189) (Pos (Succ wy190))) (Neg wy187) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];18473[label="wy189/Succ wy1890",fontsize=10,color="white",style="solid",shape="box"];6048 -> 18473[label="",style="solid", color="burlywood", weight=9];
18473 -> 6153[label="",style="solid", color="burlywood", weight=3];
18474[label="wy189/Zero",fontsize=10,color="white",style="solid",shape="box"];6048 -> 18474[label="",style="solid", color="burlywood", weight=9];
18474 -> 6154[label="",style="solid", color="burlywood", weight=3];
5597 -> 10271[label="",style="dashed", color="red", weight=0];
5597[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy107))) (Pos wy177) (iterate (primPlusInt (Pos (Succ wy1090))) (primPlusInt (Pos (Succ wy1090)) (Pos wy178))) (not (primCmpNat (Succ wy1790) (Succ wy107) == GT)))\n  Enum a",fontsize=16,color="magenta"];5597 -> 10272[label="",style="dashed", color="magenta", weight=3];
5597 -> 10273[label="",style="dashed", color="magenta", weight=3];
5597 -> 10274[label="",style="dashed", color="magenta", weight=3];
5597 -> 10275[label="",style="dashed", color="magenta", weight=3];
5597 -> 10276[label="",style="dashed", color="magenta", weight=3];
5597 -> 10277[label="",style="dashed", color="magenta", weight=3];
5598 -> 10271[label="",style="dashed", color="red", weight=0];
5598[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy107))) (Pos wy177) (iterate (primPlusInt (Pos (Succ wy1090))) (primPlusInt (Pos (Succ wy1090)) (Pos wy178))) (not (primCmpNat Zero (Succ wy107) == GT)))\n  Enum a",fontsize=16,color="magenta"];5598 -> 10278[label="",style="dashed", color="magenta", weight=3];
5598 -> 10279[label="",style="dashed", color="magenta", weight=3];
5598 -> 10280[label="",style="dashed", color="magenta", weight=3];
5598 -> 10281[label="",style="dashed", color="magenta", weight=3];
5598 -> 10282[label="",style="dashed", color="magenta", weight=3];
5598 -> 10283[label="",style="dashed", color="magenta", weight=3];
987[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (Pos (Succ wy400)) (iterate (primPlusInt (Pos (Succ wy400))) (primPlusInt (Pos (Succ wy400)) (Pos (Succ wy400)))) (not True))",fontsize=16,color="black",shape="box"];987 -> 1012[label="",style="solid", color="black", weight=3];
2422[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy60))) (primPlusInt (primMinusInt (Pos Zero) (Pos (Succ wy61))) (Pos (Succ wy61))) (iterate (primPlusInt (primMinusInt (Pos Zero) (Pos (Succ wy61)))) (primPlusInt (primMinusInt (Pos Zero) (Pos (Succ wy61))) (primPlusInt (primMinusInt (Pos Zero) (Pos (Succ wy61))) (Pos (Succ wy61))))) (not (primCmpInt (primPlusInt (primMinusInt (Pos Zero) (Pos (Succ wy61))) (Pos (Succ wy61))) (Pos (Succ wy60)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];2422 -> 2496[label="",style="solid", color="black", weight=3];
6264[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (primMinusNat (Succ wy1920) (Succ wy1930)) (Pos (Succ wy194))) (iterate (primPlusInt (primMinusNat (Succ wy1920) (Succ wy1930))) (primPlusInt (primMinusNat (Succ wy1920) (Succ wy1930)) (primPlusInt (primMinusNat (Succ wy1920) (Succ wy1930)) (Pos (Succ wy194))))) (not (primCmpInt (primPlusInt (primMinusNat (Succ wy1920) (Succ wy1930)) (Pos (Succ wy194))) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];6264 -> 6312[label="",style="solid", color="black", weight=3];
6265[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (primMinusNat (Succ wy1920) Zero) (Pos (Succ wy194))) (iterate (primPlusInt (primMinusNat (Succ wy1920) Zero)) (primPlusInt (primMinusNat (Succ wy1920) Zero) (primPlusInt (primMinusNat (Succ wy1920) Zero) (Pos (Succ wy194))))) (not (primCmpInt (primPlusInt (primMinusNat (Succ wy1920) Zero) (Pos (Succ wy194))) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];6265 -> 6313[label="",style="solid", color="black", weight=3];
6266[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (primMinusNat Zero (Succ wy1930)) (Pos (Succ wy194))) (iterate (primPlusInt (primMinusNat Zero (Succ wy1930))) (primPlusInt (primMinusNat Zero (Succ wy1930)) (primPlusInt (primMinusNat Zero (Succ wy1930)) (Pos (Succ wy194))))) (not (primCmpInt (primPlusInt (primMinusNat Zero (Succ wy1930)) (Pos (Succ wy194))) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];6266 -> 6314[label="",style="solid", color="black", weight=3];
6267[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (primMinusNat Zero Zero) (Pos (Succ wy194))) (iterate (primPlusInt (primMinusNat Zero Zero)) (primPlusInt (primMinusNat Zero Zero) (primPlusInt (primMinusNat Zero Zero) (Pos (Succ wy194))))) (not (primCmpInt (primPlusInt (primMinusNat Zero Zero) (Pos (Succ wy194))) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];6267 -> 6315[label="",style="solid", color="black", weight=3];
3361[label="Succ wy4800",fontsize=16,color="green",shape="box"];3362[label="Zero",fontsize=16,color="green",shape="box"];10067[label="wy181",fontsize=16,color="green",shape="box"];10068[label="wy180",fontsize=16,color="green",shape="box"];10069[label="wy107",fontsize=16,color="green",shape="box"];10070[label="Succ wy107",fontsize=16,color="green",shape="box"];10071[label="Succ wy1820",fontsize=16,color="green",shape="box"];10066[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy246))) (Pos wy247) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy248))) (not (primCmpNat wy249 wy250 == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];18477[label="wy249/Succ wy2490",fontsize=10,color="white",style="solid",shape="box"];10066 -> 18477[label="",style="solid", color="burlywood", weight=9];
18477 -> 10122[label="",style="solid", color="burlywood", weight=3];
18478[label="wy249/Zero",fontsize=10,color="white",style="solid",shape="box"];10066 -> 18478[label="",style="solid", color="burlywood", weight=9];
18478 -> 10123[label="",style="solid", color="burlywood", weight=3];
10072[label="wy181",fontsize=16,color="green",shape="box"];10073[label="wy180",fontsize=16,color="green",shape="box"];10074[label="wy107",fontsize=16,color="green",shape="box"];10075[label="Succ wy107",fontsize=16,color="green",shape="box"];10076[label="Zero",fontsize=16,color="green",shape="box"];1007[label="map toEnum (Pos Zero : takeWhile (flip (<=) (Pos Zero)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos Zero))))",fontsize=16,color="black",shape="box"];1007 -> 1032[label="",style="solid", color="black", weight=3];
4519[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy107))) (primPlusInt (primMinusInt (Pos (Succ wy109)) (Pos (Succ wy108))) (Pos (Succ wy108))) (iterate (primPlusInt (primMinusInt (Pos (Succ wy109)) (Pos (Succ wy108)))) (primPlusInt (primMinusInt (Pos (Succ wy109)) (Pos (Succ wy108))) (primPlusInt (primMinusInt (Pos (Succ wy109)) (Pos (Succ wy108))) (Pos (Succ wy108))))) (not (primCmpInt (primPlusInt (primMinusInt (Pos (Succ wy109)) (Pos (Succ wy108))) (Pos (Succ wy108))) (Pos (Succ wy107)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];4519 -> 4545[label="",style="solid", color="black", weight=3];
5397[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy134))) (Pos (Succ wy136) - Pos (Succ wy135) + Pos (Succ wy135)) (iterate (Pos (Succ wy136) - Pos (Succ wy135) +) (Pos (Succ wy136) - Pos (Succ wy135) + (Pos (Succ wy136) - Pos (Succ wy135) + Pos (Succ wy135)))) (not (primCmpInt (Pos (Succ wy136) - Pos (Succ wy135) + Pos (Succ wy135)) (Pos (Succ wy134)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];5397 -> 5483[label="",style="solid", color="black", weight=3];
6200[label="Succ wy48",fontsize=16,color="green",shape="box"];6201[label="wy47",fontsize=16,color="green",shape="box"];6202[label="Succ wy47",fontsize=16,color="green",shape="box"];6151[label="map toEnum (takeWhile1 (flip (>=) (Neg wy187)) (primPlusInt (primMinusNat (Succ wy1880) (Succ wy1890)) (Pos (Succ wy190))) (iterate (primPlusInt (primMinusNat (Succ wy1880) (Succ wy1890))) (primPlusInt (primMinusNat (Succ wy1880) (Succ wy1890)) (primPlusInt (primMinusNat (Succ wy1880) (Succ wy1890)) (Pos (Succ wy190))))) (not (primCmpInt (primPlusInt (primMinusNat (Succ wy1880) (Succ wy1890)) (Pos (Succ wy190))) (Neg wy187) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];6151 -> 6232[label="",style="solid", color="black", weight=3];
6152[label="map toEnum (takeWhile1 (flip (>=) (Neg wy187)) (primPlusInt (primMinusNat (Succ wy1880) Zero) (Pos (Succ wy190))) (iterate (primPlusInt (primMinusNat (Succ wy1880) Zero)) (primPlusInt (primMinusNat (Succ wy1880) Zero) (primPlusInt (primMinusNat (Succ wy1880) Zero) (Pos (Succ wy190))))) (not (primCmpInt (primPlusInt (primMinusNat (Succ wy1880) Zero) (Pos (Succ wy190))) (Neg wy187) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];6152 -> 6233[label="",style="solid", color="black", weight=3];
6153[label="map toEnum (takeWhile1 (flip (>=) (Neg wy187)) (primPlusInt (primMinusNat Zero (Succ wy1890)) (Pos (Succ wy190))) (iterate (primPlusInt (primMinusNat Zero (Succ wy1890))) (primPlusInt (primMinusNat Zero (Succ wy1890)) (primPlusInt (primMinusNat Zero (Succ wy1890)) (Pos (Succ wy190))))) (not (primCmpInt (primPlusInt (primMinusNat Zero (Succ wy1890)) (Pos (Succ wy190))) (Neg wy187) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];6153 -> 6234[label="",style="solid", color="black", weight=3];
6154[label="map toEnum (takeWhile1 (flip (>=) (Neg wy187)) (primPlusInt (primMinusNat Zero Zero) (Pos (Succ wy190))) (iterate (primPlusInt (primMinusNat Zero Zero)) (primPlusInt (primMinusNat Zero Zero) (primPlusInt (primMinusNat Zero Zero) (Pos (Succ wy190))))) (not (primCmpInt (primPlusInt (primMinusNat Zero Zero) (Pos (Succ wy190))) (Neg wy187) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];6154 -> 6235[label="",style="solid", color="black", weight=3];
10272[label="wy177",fontsize=16,color="green",shape="box"];10273[label="Succ wy1790",fontsize=16,color="green",shape="box"];10274[label="wy1090",fontsize=16,color="green",shape="box"];10275[label="Succ wy107",fontsize=16,color="green",shape="box"];10276[label="wy107",fontsize=16,color="green",shape="box"];10277[label="wy178",fontsize=16,color="green",shape="box"];10271[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy252))) (Pos wy253) (iterate (primPlusInt (Pos (Succ wy254))) (primPlusInt (Pos (Succ wy254)) (Pos wy255))) (not (primCmpNat wy256 wy257 == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];18479[label="wy256/Succ wy2560",fontsize=10,color="white",style="solid",shape="box"];10271 -> 18479[label="",style="solid", color="burlywood", weight=9];
18479 -> 10338[label="",style="solid", color="burlywood", weight=3];
18480[label="wy256/Zero",fontsize=10,color="white",style="solid",shape="box"];10271 -> 18480[label="",style="solid", color="burlywood", weight=9];
18480 -> 10339[label="",style="solid", color="burlywood", weight=3];
10278[label="wy177",fontsize=16,color="green",shape="box"];10279[label="Zero",fontsize=16,color="green",shape="box"];10280[label="wy1090",fontsize=16,color="green",shape="box"];10281[label="Succ wy107",fontsize=16,color="green",shape="box"];10282[label="wy107",fontsize=16,color="green",shape="box"];10283[label="wy178",fontsize=16,color="green",shape="box"];1012[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (Pos (Succ wy400)) (iterate (primPlusInt (Pos (Succ wy400))) (primPlusInt (Pos (Succ wy400)) (Pos (Succ wy400)))) False)",fontsize=16,color="black",shape="box"];1012 -> 1039[label="",style="solid", color="black", weight=3];
2496 -> 11220[label="",style="dashed", color="red", weight=0];
2496[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy60))) (primPlusInt (primMinusNat Zero (Succ wy61)) (Pos (Succ wy61))) (iterate (primPlusInt (primMinusNat Zero (Succ wy61))) (primPlusInt (primMinusNat Zero (Succ wy61)) (primPlusInt (primMinusNat Zero (Succ wy61)) (Pos (Succ wy61))))) (not (primCmpInt (primPlusInt (primMinusNat Zero (Succ wy61)) (Pos (Succ wy61))) (Pos (Succ wy60)) == LT)))\n  Enum a",fontsize=16,color="magenta"];2496 -> 11221[label="",style="dashed", color="magenta", weight=3];
2496 -> 11222[label="",style="dashed", color="magenta", weight=3];
2496 -> 11223[label="",style="dashed", color="magenta", weight=3];
2496 -> 11224[label="",style="dashed", color="magenta", weight=3];
6312 -> 6196[label="",style="dashed", color="red", weight=0];
6312[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (primMinusNat wy1920 wy1930) (Pos (Succ wy194))) (iterate (primPlusInt (primMinusNat wy1920 wy1930)) (primPlusInt (primMinusNat wy1920 wy1930) (primPlusInt (primMinusNat wy1920 wy1930) (Pos (Succ wy194))))) (not (primCmpInt (primPlusInt (primMinusNat wy1920 wy1930) (Pos (Succ wy194))) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="magenta"];6312 -> 6320[label="",style="dashed", color="magenta", weight=3];
6312 -> 6321[label="",style="dashed", color="magenta", weight=3];
6313[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Pos (Succ wy1920)) (Pos (Succ wy194))) (iterate (primPlusInt (Pos (Succ wy1920))) (primPlusInt (Pos (Succ wy1920)) (primPlusInt (Pos (Succ wy1920)) (Pos (Succ wy194))))) (not (primCmpInt (primPlusInt (Pos (Succ wy1920)) (Pos (Succ wy194))) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];6313 -> 6322[label="",style="solid", color="black", weight=3];
6314[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Neg (Succ wy1930)) (Pos (Succ wy194))) (iterate (primPlusInt (Neg (Succ wy1930))) (primPlusInt (Neg (Succ wy1930)) (primPlusInt (Neg (Succ wy1930)) (Pos (Succ wy194))))) (not (primCmpInt (primPlusInt (Neg (Succ wy1930)) (Pos (Succ wy194))) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="triangle"];6314 -> 6323[label="",style="solid", color="black", weight=3];
6315[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Pos Zero) (Pos (Succ wy194))) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos (Succ wy194))))) (not (primCmpInt (primPlusInt (Pos Zero) (Pos (Succ wy194))) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];6315 -> 6324[label="",style="solid", color="black", weight=3];
10122[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy246))) (Pos wy247) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy248))) (not (primCmpNat (Succ wy2490) wy250 == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];18483[label="wy250/Succ wy2500",fontsize=10,color="white",style="solid",shape="box"];10122 -> 18483[label="",style="solid", color="burlywood", weight=9];
18483 -> 10340[label="",style="solid", color="burlywood", weight=3];
18484[label="wy250/Zero",fontsize=10,color="white",style="solid",shape="box"];10122 -> 18484[label="",style="solid", color="burlywood", weight=9];
18484 -> 10341[label="",style="solid", color="burlywood", weight=3];
10123[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy246))) (Pos wy247) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy248))) (not (primCmpNat Zero wy250 == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];18485[label="wy250/Succ wy2500",fontsize=10,color="white",style="solid",shape="box"];10123 -> 18485[label="",style="solid", color="burlywood", weight=9];
18485 -> 10342[label="",style="solid", color="burlywood", weight=3];
18486[label="wy250/Zero",fontsize=10,color="white",style="solid",shape="box"];10123 -> 18486[label="",style="solid", color="burlywood", weight=9];
18486 -> 10343[label="",style="solid", color="burlywood", weight=3];
1032[label="toEnum (Pos Zero) : map toEnum (takeWhile (flip (<=) (Pos Zero)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos Zero))))",fontsize=16,color="green",shape="box"];1032 -> 1063[label="",style="dashed", color="green", weight=3];
1032 -> 1064[label="",style="dashed", color="green", weight=3];
4545 -> 9797[label="",style="dashed", color="red", weight=0];
4545[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy107))) (primPlusInt (primMinusNat (Succ wy109) (Succ wy108)) (Pos (Succ wy108))) (iterate (primPlusInt (primMinusNat (Succ wy109) (Succ wy108))) (primPlusInt (primMinusNat (Succ wy109) (Succ wy108)) (primPlusInt (primMinusNat (Succ wy109) (Succ wy108)) (Pos (Succ wy108))))) (not (primCmpInt (primPlusInt (primMinusNat (Succ wy109) (Succ wy108)) (Pos (Succ wy108))) (Pos (Succ wy107)) == GT)))\n  Enum a",fontsize=16,color="magenta"];4545 -> 9798[label="",style="dashed", color="magenta", weight=3];
4545 -> 9799[label="",style="dashed", color="magenta", weight=3];
4545 -> 9800[label="",style="dashed", color="magenta", weight=3];
4545 -> 9801[label="",style="dashed", color="magenta", weight=3];
5483[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy134))) (primPlusInt (Pos (Succ wy136) - Pos (Succ wy135)) (Pos (Succ wy135))) (iterate (primPlusInt (Pos (Succ wy136) - Pos (Succ wy135))) (primPlusInt (Pos (Succ wy136) - Pos (Succ wy135)) (primPlusInt (Pos (Succ wy136) - Pos (Succ wy135)) (Pos (Succ wy135))))) (not (primCmpInt (primPlusInt (Pos (Succ wy136) - Pos (Succ wy135)) (Pos (Succ wy135))) (Pos (Succ wy134)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];5483 -> 5578[label="",style="solid", color="black", weight=3];
6232 -> 6006[label="",style="dashed", color="red", weight=0];
6232[label="map toEnum (takeWhile1 (flip (>=) (Neg wy187)) (primPlusInt (primMinusNat wy1880 wy1890) (Pos (Succ wy190))) (iterate (primPlusInt (primMinusNat wy1880 wy1890)) (primPlusInt (primMinusNat wy1880 wy1890) (primPlusInt (primMinusNat wy1880 wy1890) (Pos (Succ wy190))))) (not (primCmpInt (primPlusInt (primMinusNat wy1880 wy1890) (Pos (Succ wy190))) (Neg wy187) == LT)))\n  Enum a",fontsize=16,color="magenta"];6232 -> 6268[label="",style="dashed", color="magenta", weight=3];
6232 -> 6269[label="",style="dashed", color="magenta", weight=3];
6233[label="map toEnum (takeWhile1 (flip (>=) (Neg wy187)) (primPlusInt (Pos (Succ wy1880)) (Pos (Succ wy190))) (iterate (primPlusInt (Pos (Succ wy1880))) (primPlusInt (Pos (Succ wy1880)) (primPlusInt (Pos (Succ wy1880)) (Pos (Succ wy190))))) (not (primCmpInt (primPlusInt (Pos (Succ wy1880)) (Pos (Succ wy190))) (Neg wy187) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];6233 -> 6270[label="",style="solid", color="black", weight=3];
6234[label="map toEnum (takeWhile1 (flip (>=) (Neg wy187)) (primPlusInt (Neg (Succ wy1890)) (Pos (Succ wy190))) (iterate (primPlusInt (Neg (Succ wy1890))) (primPlusInt (Neg (Succ wy1890)) (primPlusInt (Neg (Succ wy1890)) (Pos (Succ wy190))))) (not (primCmpInt (primPlusInt (Neg (Succ wy1890)) (Pos (Succ wy190))) (Neg wy187) == LT)))\n  Enum a",fontsize=16,color="black",shape="triangle"];6234 -> 6271[label="",style="solid", color="black", weight=3];
6235[label="map toEnum (takeWhile1 (flip (>=) (Neg wy187)) (primPlusInt (Pos Zero) (Pos (Succ wy190))) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos (Succ wy190))))) (not (primCmpInt (primPlusInt (Pos Zero) (Pos (Succ wy190))) (Neg wy187) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];6235 -> 6272[label="",style="solid", color="black", weight=3];
10338[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy252))) (Pos wy253) (iterate (primPlusInt (Pos (Succ wy254))) (primPlusInt (Pos (Succ wy254)) (Pos wy255))) (not (primCmpNat (Succ wy2560) wy257 == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];18489[label="wy257/Succ wy2570",fontsize=10,color="white",style="solid",shape="box"];10338 -> 18489[label="",style="solid", color="burlywood", weight=9];
18489 -> 10511[label="",style="solid", color="burlywood", weight=3];
18490[label="wy257/Zero",fontsize=10,color="white",style="solid",shape="box"];10338 -> 18490[label="",style="solid", color="burlywood", weight=9];
18490 -> 10512[label="",style="solid", color="burlywood", weight=3];
10339[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy252))) (Pos wy253) (iterate (primPlusInt (Pos (Succ wy254))) (primPlusInt (Pos (Succ wy254)) (Pos wy255))) (not (primCmpNat Zero wy257 == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];18491[label="wy257/Succ wy2570",fontsize=10,color="white",style="solid",shape="box"];10339 -> 18491[label="",style="solid", color="burlywood", weight=9];
18491 -> 10513[label="",style="solid", color="burlywood", weight=3];
18492[label="wy257/Zero",fontsize=10,color="white",style="solid",shape="box"];10339 -> 18492[label="",style="solid", color="burlywood", weight=9];
18492 -> 10514[label="",style="solid", color="burlywood", weight=3];
1039[label="map toEnum (takeWhile0 (flip (<=) (Pos Zero)) (Pos (Succ wy400)) (iterate (primPlusInt (Pos (Succ wy400))) (primPlusInt (Pos (Succ wy400)) (Pos (Succ wy400)))) otherwise)",fontsize=16,color="black",shape="box"];1039 -> 1085[label="",style="solid", color="black", weight=3];
11221[label="wy61",fontsize=16,color="green",shape="box"];11222[label="Succ wy61",fontsize=16,color="green",shape="box"];11223[label="wy60",fontsize=16,color="green",shape="box"];11224[label="Zero",fontsize=16,color="green",shape="box"];11220[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy276))) (primPlusInt (primMinusNat wy277 wy278) (Pos (Succ wy279))) (iterate (primPlusInt (primMinusNat wy277 wy278)) (primPlusInt (primMinusNat wy277 wy278) (primPlusInt (primMinusNat wy277 wy278) (Pos (Succ wy279))))) (not (primCmpInt (primPlusInt (primMinusNat wy277 wy278) (Pos (Succ wy279))) (Pos (Succ wy276)) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];18493[label="wy277/Succ wy2770",fontsize=10,color="white",style="solid",shape="box"];11220 -> 18493[label="",style="solid", color="burlywood", weight=9];
18493 -> 11265[label="",style="solid", color="burlywood", weight=3];
18494[label="wy277/Zero",fontsize=10,color="white",style="solid",shape="box"];11220 -> 18494[label="",style="solid", color="burlywood", weight=9];
18494 -> 11266[label="",style="solid", color="burlywood", weight=3];
6320[label="wy1920",fontsize=16,color="green",shape="box"];6321[label="wy1930",fontsize=16,color="green",shape="box"];6322 -> 6330[label="",style="dashed", color="red", weight=0];
6322[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (primPlusNat (Succ wy1920) (Succ wy194))) (iterate (primPlusInt (Pos (Succ wy1920))) (primPlusInt (Pos (Succ wy1920)) (Pos (primPlusNat (Succ wy1920) (Succ wy194))))) (not (primCmpInt (Pos (primPlusNat (Succ wy1920) (Succ wy194))) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="magenta"];6322 -> 6331[label="",style="dashed", color="magenta", weight=3];
6322 -> 6332[label="",style="dashed", color="magenta", weight=3];
6322 -> 6333[label="",style="dashed", color="magenta", weight=3];
6323 -> 10944[label="",style="dashed", color="red", weight=0];
6323[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primMinusNat (Succ wy194) (Succ wy1930)) (iterate (primPlusInt (Neg (Succ wy1930))) (primPlusInt (Neg (Succ wy1930)) (primMinusNat (Succ wy194) (Succ wy1930)))) (not (primCmpInt (primMinusNat (Succ wy194) (Succ wy1930)) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="magenta"];6323 -> 10945[label="",style="dashed", color="magenta", weight=3];
6323 -> 10946[label="",style="dashed", color="magenta", weight=3];
6323 -> 10947[label="",style="dashed", color="magenta", weight=3];
6324 -> 6335[label="",style="dashed", color="red", weight=0];
6324[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (primPlusNat Zero (Succ wy194))) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos (primPlusNat Zero (Succ wy194))))) (not (primCmpInt (Pos (primPlusNat Zero (Succ wy194))) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="magenta"];6324 -> 6336[label="",style="dashed", color="magenta", weight=3];
6324 -> 6337[label="",style="dashed", color="magenta", weight=3];
6324 -> 6338[label="",style="dashed", color="magenta", weight=3];
10340[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy246))) (Pos wy247) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy248))) (not (primCmpNat (Succ wy2490) (Succ wy2500) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];10340 -> 10515[label="",style="solid", color="black", weight=3];
10341[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy246))) (Pos wy247) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy248))) (not (primCmpNat (Succ wy2490) Zero == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];10341 -> 10516[label="",style="solid", color="black", weight=3];
10342[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy246))) (Pos wy247) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy248))) (not (primCmpNat Zero (Succ wy2500) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];10342 -> 10517[label="",style="solid", color="black", weight=3];
10343[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy246))) (Pos wy247) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy248))) (not (primCmpNat Zero Zero == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];10343 -> 10518[label="",style="solid", color="black", weight=3];
1063 -> 352[label="",style="dashed", color="red", weight=0];
1063[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];1063 -> 1109[label="",style="dashed", color="magenta", weight=3];
1064[label="map toEnum (takeWhile (flip (<=) (Pos Zero)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos Zero))))",fontsize=16,color="black",shape="box"];1064 -> 1110[label="",style="solid", color="black", weight=3];
9798[label="Succ wy109",fontsize=16,color="green",shape="box"];9799[label="wy108",fontsize=16,color="green",shape="box"];9800[label="wy107",fontsize=16,color="green",shape="box"];9801[label="Succ wy108",fontsize=16,color="green",shape="box"];9797[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy237))) (primPlusInt (primMinusNat wy238 wy239) (Pos (Succ wy240))) (iterate (primPlusInt (primMinusNat wy238 wy239)) (primPlusInt (primMinusNat wy238 wy239) (primPlusInt (primMinusNat wy238 wy239) (Pos (Succ wy240))))) (not (primCmpInt (primPlusInt (primMinusNat wy238 wy239) (Pos (Succ wy240))) (Pos (Succ wy237)) == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];18499[label="wy238/Succ wy2380",fontsize=10,color="white",style="solid",shape="box"];9797 -> 18499[label="",style="solid", color="burlywood", weight=9];
18499 -> 9838[label="",style="solid", color="burlywood", weight=3];
18500[label="wy238/Zero",fontsize=10,color="white",style="solid",shape="box"];9797 -> 18500[label="",style="solid", color="burlywood", weight=9];
18500 -> 9839[label="",style="solid", color="burlywood", weight=3];
5578[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy134))) (primPlusInt (primMinusInt (Pos (Succ wy136)) (Pos (Succ wy135))) (Pos (Succ wy135))) (iterate (primPlusInt (primMinusInt (Pos (Succ wy136)) (Pos (Succ wy135)))) (primPlusInt (primMinusInt (Pos (Succ wy136)) (Pos (Succ wy135))) (primPlusInt (primMinusInt (Pos (Succ wy136)) (Pos (Succ wy135))) (Pos (Succ wy135))))) (not (primCmpInt (primPlusInt (primMinusInt (Pos (Succ wy136)) (Pos (Succ wy135))) (Pos (Succ wy135))) (Pos (Succ wy134)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];5578 -> 5599[label="",style="solid", color="black", weight=3];
6268[label="wy1890",fontsize=16,color="green",shape="box"];6269[label="wy1880",fontsize=16,color="green",shape="box"];6270 -> 6316[label="",style="dashed", color="red", weight=0];
6270[label="map toEnum (takeWhile1 (flip (>=) (Neg wy187)) (Pos (primPlusNat (Succ wy1880) (Succ wy190))) (iterate (primPlusInt (Pos (Succ wy1880))) (primPlusInt (Pos (Succ wy1880)) (Pos (primPlusNat (Succ wy1880) (Succ wy190))))) (not (primCmpInt (Pos (primPlusNat (Succ wy1880) (Succ wy190))) (Neg wy187) == LT)))\n  Enum a",fontsize=16,color="magenta"];6270 -> 6317[label="",style="dashed", color="magenta", weight=3];
6270 -> 6318[label="",style="dashed", color="magenta", weight=3];
6270 -> 6319[label="",style="dashed", color="magenta", weight=3];
6271 -> 11139[label="",style="dashed", color="red", weight=0];
6271[label="map toEnum (takeWhile1 (flip (>=) (Neg wy187)) (primMinusNat (Succ wy190) (Succ wy1890)) (iterate (primPlusInt (Neg (Succ wy1890))) (primPlusInt (Neg (Succ wy1890)) (primMinusNat (Succ wy190) (Succ wy1890)))) (not (primCmpInt (primMinusNat (Succ wy190) (Succ wy1890)) (Neg wy187) == LT)))\n  Enum a",fontsize=16,color="magenta"];6271 -> 11140[label="",style="dashed", color="magenta", weight=3];
6271 -> 11141[label="",style="dashed", color="magenta", weight=3];
6271 -> 11142[label="",style="dashed", color="magenta", weight=3];
6271 -> 11143[label="",style="dashed", color="magenta", weight=3];
6272 -> 6326[label="",style="dashed", color="red", weight=0];
6272[label="map toEnum (takeWhile1 (flip (>=) (Neg wy187)) (Pos (primPlusNat Zero (Succ wy190))) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos (primPlusNat Zero (Succ wy190))))) (not (primCmpInt (Pos (primPlusNat Zero (Succ wy190))) (Neg wy187) == LT)))\n  Enum a",fontsize=16,color="magenta"];6272 -> 6327[label="",style="dashed", color="magenta", weight=3];
6272 -> 6328[label="",style="dashed", color="magenta", weight=3];
6272 -> 6329[label="",style="dashed", color="magenta", weight=3];
10511[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy252))) (Pos wy253) (iterate (primPlusInt (Pos (Succ wy254))) (primPlusInt (Pos (Succ wy254)) (Pos wy255))) (not (primCmpNat (Succ wy2560) (Succ wy2570) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];10511 -> 10543[label="",style="solid", color="black", weight=3];
10512[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy252))) (Pos wy253) (iterate (primPlusInt (Pos (Succ wy254))) (primPlusInt (Pos (Succ wy254)) (Pos wy255))) (not (primCmpNat (Succ wy2560) Zero == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];10512 -> 10544[label="",style="solid", color="black", weight=3];
10513[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy252))) (Pos wy253) (iterate (primPlusInt (Pos (Succ wy254))) (primPlusInt (Pos (Succ wy254)) (Pos wy255))) (not (primCmpNat Zero (Succ wy2570) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];10513 -> 10545[label="",style="solid", color="black", weight=3];
10514[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy252))) (Pos wy253) (iterate (primPlusInt (Pos (Succ wy254))) (primPlusInt (Pos (Succ wy254)) (Pos wy255))) (not (primCmpNat Zero Zero == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];10514 -> 10546[label="",style="solid", color="black", weight=3];
1085[label="map toEnum (takeWhile0 (flip (<=) (Pos Zero)) (Pos (Succ wy400)) (iterate (primPlusInt (Pos (Succ wy400))) (primPlusInt (Pos (Succ wy400)) (Pos (Succ wy400)))) True)",fontsize=16,color="black",shape="box"];1085 -> 1128[label="",style="solid", color="black", weight=3];
11265[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy276))) (primPlusInt (primMinusNat (Succ wy2770) wy278) (Pos (Succ wy279))) (iterate (primPlusInt (primMinusNat (Succ wy2770) wy278)) (primPlusInt (primMinusNat (Succ wy2770) wy278) (primPlusInt (primMinusNat (Succ wy2770) wy278) (Pos (Succ wy279))))) (not (primCmpInt (primPlusInt (primMinusNat (Succ wy2770) wy278) (Pos (Succ wy279))) (Pos (Succ wy276)) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];18504[label="wy278/Succ wy2780",fontsize=10,color="white",style="solid",shape="box"];11265 -> 18504[label="",style="solid", color="burlywood", weight=9];
18504 -> 11296[label="",style="solid", color="burlywood", weight=3];
18505[label="wy278/Zero",fontsize=10,color="white",style="solid",shape="box"];11265 -> 18505[label="",style="solid", color="burlywood", weight=9];
18505 -> 11297[label="",style="solid", color="burlywood", weight=3];
11266[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy276))) (primPlusInt (primMinusNat Zero wy278) (Pos (Succ wy279))) (iterate (primPlusInt (primMinusNat Zero wy278)) (primPlusInt (primMinusNat Zero wy278) (primPlusInt (primMinusNat Zero wy278) (Pos (Succ wy279))))) (not (primCmpInt (primPlusInt (primMinusNat Zero wy278) (Pos (Succ wy279))) (Pos (Succ wy276)) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];18506[label="wy278/Succ wy2780",fontsize=10,color="white",style="solid",shape="box"];11266 -> 18506[label="",style="solid", color="burlywood", weight=9];
18506 -> 11298[label="",style="solid", color="burlywood", weight=3];
18507[label="wy278/Zero",fontsize=10,color="white",style="solid",shape="box"];11266 -> 18507[label="",style="solid", color="burlywood", weight=9];
18507 -> 11299[label="",style="solid", color="burlywood", weight=3];
6331 -> 5172[label="",style="dashed", color="red", weight=0];
6331[label="primPlusNat (Succ wy1920) (Succ wy194)",fontsize=16,color="magenta"];6331 -> 6339[label="",style="dashed", color="magenta", weight=3];
6331 -> 6340[label="",style="dashed", color="magenta", weight=3];
6332 -> 5172[label="",style="dashed", color="red", weight=0];
6332[label="primPlusNat (Succ wy1920) (Succ wy194)",fontsize=16,color="magenta"];6332 -> 6341[label="",style="dashed", color="magenta", weight=3];
6332 -> 6342[label="",style="dashed", color="magenta", weight=3];
6333 -> 5172[label="",style="dashed", color="red", weight=0];
6333[label="primPlusNat (Succ wy1920) (Succ wy194)",fontsize=16,color="magenta"];6333 -> 6343[label="",style="dashed", color="magenta", weight=3];
6333 -> 6344[label="",style="dashed", color="magenta", weight=3];
6330[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos wy201) (iterate (primPlusInt (Pos (Succ wy1920))) (primPlusInt (Pos (Succ wy1920)) (Pos wy202))) (not (primCmpInt (Pos wy203) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];18511[label="wy203/Succ wy2030",fontsize=10,color="white",style="solid",shape="box"];6330 -> 18511[label="",style="solid", color="burlywood", weight=9];
18511 -> 6345[label="",style="solid", color="burlywood", weight=3];
18512[label="wy203/Zero",fontsize=10,color="white",style="solid",shape="box"];6330 -> 18512[label="",style="solid", color="burlywood", weight=9];
18512 -> 6346[label="",style="solid", color="burlywood", weight=3];
10945[label="Succ wy194",fontsize=16,color="green",shape="box"];10946[label="Succ wy1930",fontsize=16,color="green",shape="box"];10947[label="wy1930",fontsize=16,color="green",shape="box"];10944[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primMinusNat wy267 wy268) (iterate (primPlusInt (Neg (Succ wy269))) (primPlusInt (Neg (Succ wy269)) (primMinusNat wy267 wy268))) (not (primCmpInt (primMinusNat wy267 wy268) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];18513[label="wy267/Succ wy2670",fontsize=10,color="white",style="solid",shape="box"];10944 -> 18513[label="",style="solid", color="burlywood", weight=9];
18513 -> 10981[label="",style="solid", color="burlywood", weight=3];
18514[label="wy267/Zero",fontsize=10,color="white",style="solid",shape="box"];10944 -> 18514[label="",style="solid", color="burlywood", weight=9];
18514 -> 10982[label="",style="solid", color="burlywood", weight=3];
6336 -> 5172[label="",style="dashed", color="red", weight=0];
6336[label="primPlusNat Zero (Succ wy194)",fontsize=16,color="magenta"];6336 -> 6349[label="",style="dashed", color="magenta", weight=3];
6336 -> 6350[label="",style="dashed", color="magenta", weight=3];
6337 -> 5172[label="",style="dashed", color="red", weight=0];
6337[label="primPlusNat Zero (Succ wy194)",fontsize=16,color="magenta"];6337 -> 6351[label="",style="dashed", color="magenta", weight=3];
6337 -> 6352[label="",style="dashed", color="magenta", weight=3];
6338 -> 5172[label="",style="dashed", color="red", weight=0];
6338[label="primPlusNat Zero (Succ wy194)",fontsize=16,color="magenta"];6338 -> 6353[label="",style="dashed", color="magenta", weight=3];
6338 -> 6354[label="",style="dashed", color="magenta", weight=3];
6335[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos wy204) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy205))) (not (primCmpInt (Pos wy206) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];18518[label="wy206/Succ wy2060",fontsize=10,color="white",style="solid",shape="box"];6335 -> 18518[label="",style="solid", color="burlywood", weight=9];
18518 -> 6355[label="",style="solid", color="burlywood", weight=3];
18519[label="wy206/Zero",fontsize=10,color="white",style="solid",shape="box"];6335 -> 18519[label="",style="solid", color="burlywood", weight=9];
18519 -> 6356[label="",style="solid", color="burlywood", weight=3];
10515 -> 10066[label="",style="dashed", color="red", weight=0];
10515[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy246))) (Pos wy247) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy248))) (not (primCmpNat wy2490 wy2500 == GT)))\n  Enum a",fontsize=16,color="magenta"];10515 -> 10547[label="",style="dashed", color="magenta", weight=3];
10515 -> 10548[label="",style="dashed", color="magenta", weight=3];
10516[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy246))) (Pos wy247) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy248))) (not (GT == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];10516 -> 10549[label="",style="solid", color="black", weight=3];
10517[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy246))) (Pos wy247) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy248))) (not (LT == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];10517 -> 10550[label="",style="solid", color="black", weight=3];
10518[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy246))) (Pos wy247) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy248))) (not (EQ == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];10518 -> 10551[label="",style="solid", color="black", weight=3];
1109[label="Pos Zero",fontsize=16,color="green",shape="box"];352[label="toEnum wy10",fontsize=16,color="black",shape="triangle"];352 -> 393[label="",style="solid", color="black", weight=3];
1110[label="map toEnum (takeWhile (flip (<=) (Pos Zero)) (primPlusInt (Pos Zero) (Pos Zero) : iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos Zero)))))",fontsize=16,color="black",shape="box"];1110 -> 1152[label="",style="solid", color="black", weight=3];
9838[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy237))) (primPlusInt (primMinusNat (Succ wy2380) wy239) (Pos (Succ wy240))) (iterate (primPlusInt (primMinusNat (Succ wy2380) wy239)) (primPlusInt (primMinusNat (Succ wy2380) wy239) (primPlusInt (primMinusNat (Succ wy2380) wy239) (Pos (Succ wy240))))) (not (primCmpInt (primPlusInt (primMinusNat (Succ wy2380) wy239) (Pos (Succ wy240))) (Pos (Succ wy237)) == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];18521[label="wy239/Succ wy2390",fontsize=10,color="white",style="solid",shape="box"];9838 -> 18521[label="",style="solid", color="burlywood", weight=9];
18521 -> 10058[label="",style="solid", color="burlywood", weight=3];
18522[label="wy239/Zero",fontsize=10,color="white",style="solid",shape="box"];9838 -> 18522[label="",style="solid", color="burlywood", weight=9];
18522 -> 10059[label="",style="solid", color="burlywood", weight=3];
9839[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy237))) (primPlusInt (primMinusNat Zero wy239) (Pos (Succ wy240))) (iterate (primPlusInt (primMinusNat Zero wy239)) (primPlusInt (primMinusNat Zero wy239) (primPlusInt (primMinusNat Zero wy239) (Pos (Succ wy240))))) (not (primCmpInt (primPlusInt (primMinusNat Zero wy239) (Pos (Succ wy240))) (Pos (Succ wy237)) == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];18523[label="wy239/Succ wy2390",fontsize=10,color="white",style="solid",shape="box"];9839 -> 18523[label="",style="solid", color="burlywood", weight=9];
18523 -> 10060[label="",style="solid", color="burlywood", weight=3];
18524[label="wy239/Zero",fontsize=10,color="white",style="solid",shape="box"];9839 -> 18524[label="",style="solid", color="burlywood", weight=9];
18524 -> 10061[label="",style="solid", color="burlywood", weight=3];
5599 -> 11220[label="",style="dashed", color="red", weight=0];
5599[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy134))) (primPlusInt (primMinusNat (Succ wy136) (Succ wy135)) (Pos (Succ wy135))) (iterate (primPlusInt (primMinusNat (Succ wy136) (Succ wy135))) (primPlusInt (primMinusNat (Succ wy136) (Succ wy135)) (primPlusInt (primMinusNat (Succ wy136) (Succ wy135)) (Pos (Succ wy135))))) (not (primCmpInt (primPlusInt (primMinusNat (Succ wy136) (Succ wy135)) (Pos (Succ wy135))) (Pos (Succ wy134)) == LT)))\n  Enum a",fontsize=16,color="magenta"];5599 -> 11225[label="",style="dashed", color="magenta", weight=3];
5599 -> 11226[label="",style="dashed", color="magenta", weight=3];
5599 -> 11227[label="",style="dashed", color="magenta", weight=3];
5599 -> 11228[label="",style="dashed", color="magenta", weight=3];
6317 -> 5172[label="",style="dashed", color="red", weight=0];
6317[label="primPlusNat (Succ wy1880) (Succ wy190)",fontsize=16,color="magenta"];6317 -> 6363[label="",style="dashed", color="magenta", weight=3];
6317 -> 6364[label="",style="dashed", color="magenta", weight=3];
6318 -> 5172[label="",style="dashed", color="red", weight=0];
6318[label="primPlusNat (Succ wy1880) (Succ wy190)",fontsize=16,color="magenta"];6318 -> 6365[label="",style="dashed", color="magenta", weight=3];
6318 -> 6366[label="",style="dashed", color="magenta", weight=3];
6319 -> 5172[label="",style="dashed", color="red", weight=0];
6319[label="primPlusNat (Succ wy1880) (Succ wy190)",fontsize=16,color="magenta"];6319 -> 6367[label="",style="dashed", color="magenta", weight=3];
6319 -> 6368[label="",style="dashed", color="magenta", weight=3];
6316[label="map toEnum (takeWhile1 (flip (>=) (Neg wy187)) (Pos wy195) (iterate (primPlusInt (Pos (Succ wy1880))) (primPlusInt (Pos (Succ wy1880)) (Pos wy196))) (not (primCmpInt (Pos wy197) (Neg wy187) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];18529[label="wy197/Succ wy1970",fontsize=10,color="white",style="solid",shape="box"];6316 -> 18529[label="",style="solid", color="burlywood", weight=9];
18529 -> 6369[label="",style="solid", color="burlywood", weight=3];
18530[label="wy197/Zero",fontsize=10,color="white",style="solid",shape="box"];6316 -> 18530[label="",style="solid", color="burlywood", weight=9];
18530 -> 6370[label="",style="solid", color="burlywood", weight=3];
11140[label="Succ wy190",fontsize=16,color="green",shape="box"];11141[label="wy187",fontsize=16,color="green",shape="box"];11142[label="wy1890",fontsize=16,color="green",shape="box"];11143[label="Succ wy1890",fontsize=16,color="green",shape="box"];11139[label="map toEnum (takeWhile1 (flip (>=) (Neg wy271)) (primMinusNat wy272 wy273) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (primMinusNat wy272 wy273))) (not (primCmpInt (primMinusNat wy272 wy273) (Neg wy271) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];18531[label="wy272/Succ wy2720",fontsize=10,color="white",style="solid",shape="box"];11139 -> 18531[label="",style="solid", color="burlywood", weight=9];
18531 -> 11200[label="",style="solid", color="burlywood", weight=3];
18532[label="wy272/Zero",fontsize=10,color="white",style="solid",shape="box"];11139 -> 18532[label="",style="solid", color="burlywood", weight=9];
18532 -> 11201[label="",style="solid", color="burlywood", weight=3];
6327 -> 5172[label="",style="dashed", color="red", weight=0];
6327[label="primPlusNat Zero (Succ wy190)",fontsize=16,color="magenta"];6327 -> 6373[label="",style="dashed", color="magenta", weight=3];
6327 -> 6374[label="",style="dashed", color="magenta", weight=3];
6328 -> 5172[label="",style="dashed", color="red", weight=0];
6328[label="primPlusNat Zero (Succ wy190)",fontsize=16,color="magenta"];6328 -> 6375[label="",style="dashed", color="magenta", weight=3];
6328 -> 6376[label="",style="dashed", color="magenta", weight=3];
6329 -> 5172[label="",style="dashed", color="red", weight=0];
6329[label="primPlusNat Zero (Succ wy190)",fontsize=16,color="magenta"];6329 -> 6377[label="",style="dashed", color="magenta", weight=3];
6329 -> 6378[label="",style="dashed", color="magenta", weight=3];
6326[label="map toEnum (takeWhile1 (flip (>=) (Neg wy187)) (Pos wy198) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy199))) (not (primCmpInt (Pos wy200) (Neg wy187) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];18536[label="wy200/Succ wy2000",fontsize=10,color="white",style="solid",shape="box"];6326 -> 18536[label="",style="solid", color="burlywood", weight=9];
18536 -> 6379[label="",style="solid", color="burlywood", weight=3];
18537[label="wy200/Zero",fontsize=10,color="white",style="solid",shape="box"];6326 -> 18537[label="",style="solid", color="burlywood", weight=9];
18537 -> 6380[label="",style="solid", color="burlywood", weight=3];
10543 -> 10271[label="",style="dashed", color="red", weight=0];
10543[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy252))) (Pos wy253) (iterate (primPlusInt (Pos (Succ wy254))) (primPlusInt (Pos (Succ wy254)) (Pos wy255))) (not (primCmpNat wy2560 wy2570 == GT)))\n  Enum a",fontsize=16,color="magenta"];10543 -> 10572[label="",style="dashed", color="magenta", weight=3];
10543 -> 10573[label="",style="dashed", color="magenta", weight=3];
10544[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy252))) (Pos wy253) (iterate (primPlusInt (Pos (Succ wy254))) (primPlusInt (Pos (Succ wy254)) (Pos wy255))) (not (GT == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];10544 -> 10574[label="",style="solid", color="black", weight=3];
10545[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy252))) (Pos wy253) (iterate (primPlusInt (Pos (Succ wy254))) (primPlusInt (Pos (Succ wy254)) (Pos wy255))) (not (LT == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];10545 -> 10575[label="",style="solid", color="black", weight=3];
10546[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy252))) (Pos wy253) (iterate (primPlusInt (Pos (Succ wy254))) (primPlusInt (Pos (Succ wy254)) (Pos wy255))) (not (EQ == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];10546 -> 10576[label="",style="solid", color="black", weight=3];
1128 -> 459[label="",style="dashed", color="red", weight=0];
1128[label="map toEnum []",fontsize=16,color="magenta"];11296[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy276))) (primPlusInt (primMinusNat (Succ wy2770) (Succ wy2780)) (Pos (Succ wy279))) (iterate (primPlusInt (primMinusNat (Succ wy2770) (Succ wy2780))) (primPlusInt (primMinusNat (Succ wy2770) (Succ wy2780)) (primPlusInt (primMinusNat (Succ wy2770) (Succ wy2780)) (Pos (Succ wy279))))) (not (primCmpInt (primPlusInt (primMinusNat (Succ wy2770) (Succ wy2780)) (Pos (Succ wy279))) (Pos (Succ wy276)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];11296 -> 11340[label="",style="solid", color="black", weight=3];
11297[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy276))) (primPlusInt (primMinusNat (Succ wy2770) Zero) (Pos (Succ wy279))) (iterate (primPlusInt (primMinusNat (Succ wy2770) Zero)) (primPlusInt (primMinusNat (Succ wy2770) Zero) (primPlusInt (primMinusNat (Succ wy2770) Zero) (Pos (Succ wy279))))) (not (primCmpInt (primPlusInt (primMinusNat (Succ wy2770) Zero) (Pos (Succ wy279))) (Pos (Succ wy276)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];11297 -> 11341[label="",style="solid", color="black", weight=3];
11298[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy276))) (primPlusInt (primMinusNat Zero (Succ wy2780)) (Pos (Succ wy279))) (iterate (primPlusInt (primMinusNat Zero (Succ wy2780))) (primPlusInt (primMinusNat Zero (Succ wy2780)) (primPlusInt (primMinusNat Zero (Succ wy2780)) (Pos (Succ wy279))))) (not (primCmpInt (primPlusInt (primMinusNat Zero (Succ wy2780)) (Pos (Succ wy279))) (Pos (Succ wy276)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];11298 -> 11342[label="",style="solid", color="black", weight=3];
11299[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy276))) (primPlusInt (primMinusNat Zero Zero) (Pos (Succ wy279))) (iterate (primPlusInt (primMinusNat Zero Zero)) (primPlusInt (primMinusNat Zero Zero) (primPlusInt (primMinusNat Zero Zero) (Pos (Succ wy279))))) (not (primCmpInt (primPlusInt (primMinusNat Zero Zero) (Pos (Succ wy279))) (Pos (Succ wy276)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];11299 -> 11343[label="",style="solid", color="black", weight=3];
6339[label="Succ wy194",fontsize=16,color="green",shape="box"];6340[label="Succ wy1920",fontsize=16,color="green",shape="box"];5172[label="primPlusNat wy105 wy104",fontsize=16,color="burlywood",shape="triangle"];18540[label="wy105/Succ wy1050",fontsize=10,color="white",style="solid",shape="box"];5172 -> 18540[label="",style="solid", color="burlywood", weight=9];
18540 -> 5835[label="",style="solid", color="burlywood", weight=3];
18541[label="wy105/Zero",fontsize=10,color="white",style="solid",shape="box"];5172 -> 18541[label="",style="solid", color="burlywood", weight=9];
18541 -> 5836[label="",style="solid", color="burlywood", weight=3];
6341[label="Succ wy194",fontsize=16,color="green",shape="box"];6342[label="Succ wy1920",fontsize=16,color="green",shape="box"];6343[label="Succ wy194",fontsize=16,color="green",shape="box"];6344[label="Succ wy1920",fontsize=16,color="green",shape="box"];6345[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos wy201) (iterate (primPlusInt (Pos (Succ wy1920))) (primPlusInt (Pos (Succ wy1920)) (Pos wy202))) (not (primCmpInt (Pos (Succ wy2030)) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];6345 -> 6397[label="",style="solid", color="black", weight=3];
6346[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos wy201) (iterate (primPlusInt (Pos (Succ wy1920))) (primPlusInt (Pos (Succ wy1920)) (Pos wy202))) (not (primCmpInt (Pos Zero) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];6346 -> 6398[label="",style="solid", color="black", weight=3];
10981[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primMinusNat (Succ wy2670) wy268) (iterate (primPlusInt (Neg (Succ wy269))) (primPlusInt (Neg (Succ wy269)) (primMinusNat (Succ wy2670) wy268))) (not (primCmpInt (primMinusNat (Succ wy2670) wy268) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];18542[label="wy268/Succ wy2680",fontsize=10,color="white",style="solid",shape="box"];10981 -> 18542[label="",style="solid", color="burlywood", weight=9];
18542 -> 11202[label="",style="solid", color="burlywood", weight=3];
18543[label="wy268/Zero",fontsize=10,color="white",style="solid",shape="box"];10981 -> 18543[label="",style="solid", color="burlywood", weight=9];
18543 -> 11203[label="",style="solid", color="burlywood", weight=3];
10982[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primMinusNat Zero wy268) (iterate (primPlusInt (Neg (Succ wy269))) (primPlusInt (Neg (Succ wy269)) (primMinusNat Zero wy268))) (not (primCmpInt (primMinusNat Zero wy268) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];18544[label="wy268/Succ wy2680",fontsize=10,color="white",style="solid",shape="box"];10982 -> 18544[label="",style="solid", color="burlywood", weight=9];
18544 -> 11204[label="",style="solid", color="burlywood", weight=3];
18545[label="wy268/Zero",fontsize=10,color="white",style="solid",shape="box"];10982 -> 18545[label="",style="solid", color="burlywood", weight=9];
18545 -> 11205[label="",style="solid", color="burlywood", weight=3];
6349[label="Succ wy194",fontsize=16,color="green",shape="box"];6350[label="Zero",fontsize=16,color="green",shape="box"];6351[label="Succ wy194",fontsize=16,color="green",shape="box"];6352[label="Zero",fontsize=16,color="green",shape="box"];6353[label="Succ wy194",fontsize=16,color="green",shape="box"];6354[label="Zero",fontsize=16,color="green",shape="box"];6355[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos wy204) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy205))) (not (primCmpInt (Pos (Succ wy2060)) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];6355 -> 6403[label="",style="solid", color="black", weight=3];
6356[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos wy204) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy205))) (not (primCmpInt (Pos Zero) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];6356 -> 6404[label="",style="solid", color="black", weight=3];
10547[label="wy2500",fontsize=16,color="green",shape="box"];10548[label="wy2490",fontsize=16,color="green",shape="box"];10549[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy246))) (Pos wy247) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy248))) (not True))\n  Enum a",fontsize=16,color="black",shape="box"];10549 -> 10577[label="",style="solid", color="black", weight=3];
10550[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy246))) (Pos wy247) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy248))) (not False))\n  Enum a",fontsize=16,color="black",shape="triangle"];10550 -> 10578[label="",style="solid", color="black", weight=3];
10551 -> 10550[label="",style="dashed", color="red", weight=0];
10551[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy246))) (Pos wy247) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy248))) (not False))\n  Enum a",fontsize=16,color="magenta"];1152[label="map toEnum (takeWhile2 (flip (<=) (Pos Zero)) (primPlusInt (Pos Zero) (Pos Zero) : iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos Zero)))))",fontsize=16,color="black",shape="box"];1152 -> 1208[label="",style="solid", color="black", weight=3];
10058[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy237))) (primPlusInt (primMinusNat (Succ wy2380) (Succ wy2390)) (Pos (Succ wy240))) (iterate (primPlusInt (primMinusNat (Succ wy2380) (Succ wy2390))) (primPlusInt (primMinusNat (Succ wy2380) (Succ wy2390)) (primPlusInt (primMinusNat (Succ wy2380) (Succ wy2390)) (Pos (Succ wy240))))) (not (primCmpInt (primPlusInt (primMinusNat (Succ wy2380) (Succ wy2390)) (Pos (Succ wy240))) (Pos (Succ wy237)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];10058 -> 10124[label="",style="solid", color="black", weight=3];
10059[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy237))) (primPlusInt (primMinusNat (Succ wy2380) Zero) (Pos (Succ wy240))) (iterate (primPlusInt (primMinusNat (Succ wy2380) Zero)) (primPlusInt (primMinusNat (Succ wy2380) Zero) (primPlusInt (primMinusNat (Succ wy2380) Zero) (Pos (Succ wy240))))) (not (primCmpInt (primPlusInt (primMinusNat (Succ wy2380) Zero) (Pos (Succ wy240))) (Pos (Succ wy237)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];10059 -> 10125[label="",style="solid", color="black", weight=3];
10060[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy237))) (primPlusInt (primMinusNat Zero (Succ wy2390)) (Pos (Succ wy240))) (iterate (primPlusInt (primMinusNat Zero (Succ wy2390))) (primPlusInt (primMinusNat Zero (Succ wy2390)) (primPlusInt (primMinusNat Zero (Succ wy2390)) (Pos (Succ wy240))))) (not (primCmpInt (primPlusInt (primMinusNat Zero (Succ wy2390)) (Pos (Succ wy240))) (Pos (Succ wy237)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];10060 -> 10126[label="",style="solid", color="black", weight=3];
10061[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy237))) (primPlusInt (primMinusNat Zero Zero) (Pos (Succ wy240))) (iterate (primPlusInt (primMinusNat Zero Zero)) (primPlusInt (primMinusNat Zero Zero) (primPlusInt (primMinusNat Zero Zero) (Pos (Succ wy240))))) (not (primCmpInt (primPlusInt (primMinusNat Zero Zero) (Pos (Succ wy240))) (Pos (Succ wy237)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];10061 -> 10127[label="",style="solid", color="black", weight=3];
11225[label="wy135",fontsize=16,color="green",shape="box"];11226[label="Succ wy135",fontsize=16,color="green",shape="box"];11227[label="wy134",fontsize=16,color="green",shape="box"];11228[label="Succ wy136",fontsize=16,color="green",shape="box"];6363[label="Succ wy190",fontsize=16,color="green",shape="box"];6364[label="Succ wy1880",fontsize=16,color="green",shape="box"];6365[label="Succ wy190",fontsize=16,color="green",shape="box"];6366[label="Succ wy1880",fontsize=16,color="green",shape="box"];6367[label="Succ wy190",fontsize=16,color="green",shape="box"];6368[label="Succ wy1880",fontsize=16,color="green",shape="box"];6369[label="map toEnum (takeWhile1 (flip (>=) (Neg wy187)) (Pos wy195) (iterate (primPlusInt (Pos (Succ wy1880))) (primPlusInt (Pos (Succ wy1880)) (Pos wy196))) (not (primCmpInt (Pos (Succ wy1970)) (Neg wy187) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];6369 -> 6413[label="",style="solid", color="black", weight=3];
6370[label="map toEnum (takeWhile1 (flip (>=) (Neg wy187)) (Pos wy195) (iterate (primPlusInt (Pos (Succ wy1880))) (primPlusInt (Pos (Succ wy1880)) (Pos wy196))) (not (primCmpInt (Pos Zero) (Neg wy187) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];18547[label="wy187/Succ wy1870",fontsize=10,color="white",style="solid",shape="box"];6370 -> 18547[label="",style="solid", color="burlywood", weight=9];
18547 -> 6414[label="",style="solid", color="burlywood", weight=3];
18548[label="wy187/Zero",fontsize=10,color="white",style="solid",shape="box"];6370 -> 18548[label="",style="solid", color="burlywood", weight=9];
18548 -> 6415[label="",style="solid", color="burlywood", weight=3];
11200[label="map toEnum (takeWhile1 (flip (>=) (Neg wy271)) (primMinusNat (Succ wy2720) wy273) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (primMinusNat (Succ wy2720) wy273))) (not (primCmpInt (primMinusNat (Succ wy2720) wy273) (Neg wy271) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];18549[label="wy273/Succ wy2730",fontsize=10,color="white",style="solid",shape="box"];11200 -> 18549[label="",style="solid", color="burlywood", weight=9];
18549 -> 11267[label="",style="solid", color="burlywood", weight=3];
18550[label="wy273/Zero",fontsize=10,color="white",style="solid",shape="box"];11200 -> 18550[label="",style="solid", color="burlywood", weight=9];
18550 -> 11268[label="",style="solid", color="burlywood", weight=3];
11201[label="map toEnum (takeWhile1 (flip (>=) (Neg wy271)) (primMinusNat Zero wy273) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (primMinusNat Zero wy273))) (not (primCmpInt (primMinusNat Zero wy273) (Neg wy271) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];18551[label="wy273/Succ wy2730",fontsize=10,color="white",style="solid",shape="box"];11201 -> 18551[label="",style="solid", color="burlywood", weight=9];
18551 -> 11269[label="",style="solid", color="burlywood", weight=3];
18552[label="wy273/Zero",fontsize=10,color="white",style="solid",shape="box"];11201 -> 18552[label="",style="solid", color="burlywood", weight=9];
18552 -> 11270[label="",style="solid", color="burlywood", weight=3];
6373[label="Succ wy190",fontsize=16,color="green",shape="box"];6374[label="Zero",fontsize=16,color="green",shape="box"];6375[label="Succ wy190",fontsize=16,color="green",shape="box"];6376[label="Zero",fontsize=16,color="green",shape="box"];6377[label="Succ wy190",fontsize=16,color="green",shape="box"];6378[label="Zero",fontsize=16,color="green",shape="box"];6379[label="map toEnum (takeWhile1 (flip (>=) (Neg wy187)) (Pos wy198) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy199))) (not (primCmpInt (Pos (Succ wy2000)) (Neg wy187) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];6379 -> 6420[label="",style="solid", color="black", weight=3];
6380[label="map toEnum (takeWhile1 (flip (>=) (Neg wy187)) (Pos wy198) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy199))) (not (primCmpInt (Pos Zero) (Neg wy187) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];18553[label="wy187/Succ wy1870",fontsize=10,color="white",style="solid",shape="box"];6380 -> 18553[label="",style="solid", color="burlywood", weight=9];
18553 -> 6421[label="",style="solid", color="burlywood", weight=3];
18554[label="wy187/Zero",fontsize=10,color="white",style="solid",shape="box"];6380 -> 18554[label="",style="solid", color="burlywood", weight=9];
18554 -> 6422[label="",style="solid", color="burlywood", weight=3];
10572[label="wy2560",fontsize=16,color="green",shape="box"];10573[label="wy2570",fontsize=16,color="green",shape="box"];10574[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy252))) (Pos wy253) (iterate (primPlusInt (Pos (Succ wy254))) (primPlusInt (Pos (Succ wy254)) (Pos wy255))) (not True))\n  Enum a",fontsize=16,color="black",shape="box"];10574 -> 10931[label="",style="solid", color="black", weight=3];
10575[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy252))) (Pos wy253) (iterate (primPlusInt (Pos (Succ wy254))) (primPlusInt (Pos (Succ wy254)) (Pos wy255))) (not False))\n  Enum a",fontsize=16,color="black",shape="triangle"];10575 -> 10932[label="",style="solid", color="black", weight=3];
10576 -> 10575[label="",style="dashed", color="red", weight=0];
10576[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy252))) (Pos wy253) (iterate (primPlusInt (Pos (Succ wy254))) (primPlusInt (Pos (Succ wy254)) (Pos wy255))) (not False))\n  Enum a",fontsize=16,color="magenta"];459[label="map toEnum []",fontsize=16,color="black",shape="triangle"];459 -> 515[label="",style="solid", color="black", weight=3];
11340 -> 11220[label="",style="dashed", color="red", weight=0];
11340[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy276))) (primPlusInt (primMinusNat wy2770 wy2780) (Pos (Succ wy279))) (iterate (primPlusInt (primMinusNat wy2770 wy2780)) (primPlusInt (primMinusNat wy2770 wy2780) (primPlusInt (primMinusNat wy2770 wy2780) (Pos (Succ wy279))))) (not (primCmpInt (primPlusInt (primMinusNat wy2770 wy2780) (Pos (Succ wy279))) (Pos (Succ wy276)) == LT)))\n  Enum a",fontsize=16,color="magenta"];11340 -> 11377[label="",style="dashed", color="magenta", weight=3];
11340 -> 11378[label="",style="dashed", color="magenta", weight=3];
11341[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy276))) (primPlusInt (Pos (Succ wy2770)) (Pos (Succ wy279))) (iterate (primPlusInt (Pos (Succ wy2770))) (primPlusInt (Pos (Succ wy2770)) (primPlusInt (Pos (Succ wy2770)) (Pos (Succ wy279))))) (not (primCmpInt (primPlusInt (Pos (Succ wy2770)) (Pos (Succ wy279))) (Pos (Succ wy276)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];11341 -> 11379[label="",style="solid", color="black", weight=3];
11342[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy276))) (primPlusInt (Neg (Succ wy2780)) (Pos (Succ wy279))) (iterate (primPlusInt (Neg (Succ wy2780))) (primPlusInt (Neg (Succ wy2780)) (primPlusInt (Neg (Succ wy2780)) (Pos (Succ wy279))))) (not (primCmpInt (primPlusInt (Neg (Succ wy2780)) (Pos (Succ wy279))) (Pos (Succ wy276)) == LT)))\n  Enum a",fontsize=16,color="black",shape="triangle"];11342 -> 11380[label="",style="solid", color="black", weight=3];
11343[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy276))) (primPlusInt (Pos Zero) (Pos (Succ wy279))) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos (Succ wy279))))) (not (primCmpInt (primPlusInt (Pos Zero) (Pos (Succ wy279))) (Pos (Succ wy276)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];11343 -> 11381[label="",style="solid", color="black", weight=3];
5835[label="primPlusNat (Succ wy1050) wy104",fontsize=16,color="burlywood",shape="box"];18557[label="wy104/Succ wy1040",fontsize=10,color="white",style="solid",shape="box"];5835 -> 18557[label="",style="solid", color="burlywood", weight=9];
18557 -> 6058[label="",style="solid", color="burlywood", weight=3];
18558[label="wy104/Zero",fontsize=10,color="white",style="solid",shape="box"];5835 -> 18558[label="",style="solid", color="burlywood", weight=9];
18558 -> 6059[label="",style="solid", color="burlywood", weight=3];
5836[label="primPlusNat Zero wy104",fontsize=16,color="burlywood",shape="box"];18559[label="wy104/Succ wy1040",fontsize=10,color="white",style="solid",shape="box"];5836 -> 18559[label="",style="solid", color="burlywood", weight=9];
18559 -> 6060[label="",style="solid", color="burlywood", weight=3];
18560[label="wy104/Zero",fontsize=10,color="white",style="solid",shape="box"];5836 -> 18560[label="",style="solid", color="burlywood", weight=9];
18560 -> 6061[label="",style="solid", color="burlywood", weight=3];
6397[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos wy201) (iterate (primPlusInt (Pos (Succ wy1920))) (primPlusInt (Pos (Succ wy1920)) (Pos wy202))) (not (primCmpNat (Succ wy2030) Zero == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];6397 -> 6443[label="",style="solid", color="black", weight=3];
6398[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos wy201) (iterate (primPlusInt (Pos (Succ wy1920))) (primPlusInt (Pos (Succ wy1920)) (Pos wy202))) (not (EQ == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];6398 -> 6444[label="",style="solid", color="black", weight=3];
11202[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primMinusNat (Succ wy2670) (Succ wy2680)) (iterate (primPlusInt (Neg (Succ wy269))) (primPlusInt (Neg (Succ wy269)) (primMinusNat (Succ wy2670) (Succ wy2680)))) (not (primCmpInt (primMinusNat (Succ wy2670) (Succ wy2680)) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];11202 -> 11271[label="",style="solid", color="black", weight=3];
11203[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primMinusNat (Succ wy2670) Zero) (iterate (primPlusInt (Neg (Succ wy269))) (primPlusInt (Neg (Succ wy269)) (primMinusNat (Succ wy2670) Zero))) (not (primCmpInt (primMinusNat (Succ wy2670) Zero) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];11203 -> 11272[label="",style="solid", color="black", weight=3];
11204[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primMinusNat Zero (Succ wy2680)) (iterate (primPlusInt (Neg (Succ wy269))) (primPlusInt (Neg (Succ wy269)) (primMinusNat Zero (Succ wy2680)))) (not (primCmpInt (primMinusNat Zero (Succ wy2680)) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];11204 -> 11273[label="",style="solid", color="black", weight=3];
11205[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primMinusNat Zero Zero) (iterate (primPlusInt (Neg (Succ wy269))) (primPlusInt (Neg (Succ wy269)) (primMinusNat Zero Zero))) (not (primCmpInt (primMinusNat Zero Zero) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];11205 -> 11274[label="",style="solid", color="black", weight=3];
6403[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos wy204) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy205))) (not (primCmpNat (Succ wy2060) Zero == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];6403 -> 6449[label="",style="solid", color="black", weight=3];
6404[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos wy204) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy205))) (not (EQ == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];6404 -> 6450[label="",style="solid", color="black", weight=3];
10577[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy246))) (Pos wy247) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy248))) False)\n  Enum a",fontsize=16,color="black",shape="box"];10577 -> 10933[label="",style="solid", color="black", weight=3];
10578[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy246))) (Pos wy247) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy248))) True)\n  Enum a",fontsize=16,color="black",shape="box"];10578 -> 10934[label="",style="solid", color="black", weight=3];
1208[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (primPlusInt (Pos Zero) (Pos Zero)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos Zero)))) (flip (<=) (Pos Zero) (primPlusInt (Pos Zero) (Pos Zero))))",fontsize=16,color="black",shape="box"];1208 -> 1249[label="",style="solid", color="black", weight=3];
10124 -> 9797[label="",style="dashed", color="red", weight=0];
10124[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy237))) (primPlusInt (primMinusNat wy2380 wy2390) (Pos (Succ wy240))) (iterate (primPlusInt (primMinusNat wy2380 wy2390)) (primPlusInt (primMinusNat wy2380 wy2390) (primPlusInt (primMinusNat wy2380 wy2390) (Pos (Succ wy240))))) (not (primCmpInt (primPlusInt (primMinusNat wy2380 wy2390) (Pos (Succ wy240))) (Pos (Succ wy237)) == GT)))\n  Enum a",fontsize=16,color="magenta"];10124 -> 10344[label="",style="dashed", color="magenta", weight=3];
10124 -> 10345[label="",style="dashed", color="magenta", weight=3];
10125[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy237))) (primPlusInt (Pos (Succ wy2380)) (Pos (Succ wy240))) (iterate (primPlusInt (Pos (Succ wy2380))) (primPlusInt (Pos (Succ wy2380)) (primPlusInt (Pos (Succ wy2380)) (Pos (Succ wy240))))) (not (primCmpInt (primPlusInt (Pos (Succ wy2380)) (Pos (Succ wy240))) (Pos (Succ wy237)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];10125 -> 10346[label="",style="solid", color="black", weight=3];
10126[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy237))) (primPlusInt (Neg (Succ wy2390)) (Pos (Succ wy240))) (iterate (primPlusInt (Neg (Succ wy2390))) (primPlusInt (Neg (Succ wy2390)) (primPlusInt (Neg (Succ wy2390)) (Pos (Succ wy240))))) (not (primCmpInt (primPlusInt (Neg (Succ wy2390)) (Pos (Succ wy240))) (Pos (Succ wy237)) == GT)))\n  Enum a",fontsize=16,color="black",shape="triangle"];10126 -> 10347[label="",style="solid", color="black", weight=3];
10127[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy237))) (primPlusInt (Pos Zero) (Pos (Succ wy240))) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos (Succ wy240))))) (not (primCmpInt (primPlusInt (Pos Zero) (Pos (Succ wy240))) (Pos (Succ wy237)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];10127 -> 10348[label="",style="solid", color="black", weight=3];
6413[label="map toEnum (takeWhile1 (flip (>=) (Neg wy187)) (Pos wy195) (iterate (primPlusInt (Pos (Succ wy1880))) (primPlusInt (Pos (Succ wy1880)) (Pos wy196))) (not (GT == LT)))\n  Enum a",fontsize=16,color="black",shape="triangle"];6413 -> 6466[label="",style="solid", color="black", weight=3];
6414[label="map toEnum (takeWhile1 (flip (>=) (Neg (Succ wy1870))) (Pos wy195) (iterate (primPlusInt (Pos (Succ wy1880))) (primPlusInt (Pos (Succ wy1880)) (Pos wy196))) (not (primCmpInt (Pos Zero) (Neg (Succ wy1870)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];6414 -> 6467[label="",style="solid", color="black", weight=3];
6415[label="map toEnum (takeWhile1 (flip (>=) (Neg Zero)) (Pos wy195) (iterate (primPlusInt (Pos (Succ wy1880))) (primPlusInt (Pos (Succ wy1880)) (Pos wy196))) (not (primCmpInt (Pos Zero) (Neg Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];6415 -> 6468[label="",style="solid", color="black", weight=3];
11267[label="map toEnum (takeWhile1 (flip (>=) (Neg wy271)) (primMinusNat (Succ wy2720) (Succ wy2730)) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (primMinusNat (Succ wy2720) (Succ wy2730)))) (not (primCmpInt (primMinusNat (Succ wy2720) (Succ wy2730)) (Neg wy271) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];11267 -> 11300[label="",style="solid", color="black", weight=3];
11268[label="map toEnum (takeWhile1 (flip (>=) (Neg wy271)) (primMinusNat (Succ wy2720) Zero) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (primMinusNat (Succ wy2720) Zero))) (not (primCmpInt (primMinusNat (Succ wy2720) Zero) (Neg wy271) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];11268 -> 11301[label="",style="solid", color="black", weight=3];
11269[label="map toEnum (takeWhile1 (flip (>=) (Neg wy271)) (primMinusNat Zero (Succ wy2730)) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (primMinusNat Zero (Succ wy2730)))) (not (primCmpInt (primMinusNat Zero (Succ wy2730)) (Neg wy271) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];11269 -> 11302[label="",style="solid", color="black", weight=3];
11270[label="map toEnum (takeWhile1 (flip (>=) (Neg wy271)) (primMinusNat Zero Zero) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (primMinusNat Zero Zero))) (not (primCmpInt (primMinusNat Zero Zero) (Neg wy271) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];11270 -> 11303[label="",style="solid", color="black", weight=3];
6420[label="map toEnum (takeWhile1 (flip (>=) (Neg wy187)) (Pos wy198) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy199))) (not (GT == LT)))\n  Enum a",fontsize=16,color="black",shape="triangle"];6420 -> 6473[label="",style="solid", color="black", weight=3];
6421[label="map toEnum (takeWhile1 (flip (>=) (Neg (Succ wy1870))) (Pos wy198) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy199))) (not (primCmpInt (Pos Zero) (Neg (Succ wy1870)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];6421 -> 6474[label="",style="solid", color="black", weight=3];
6422[label="map toEnum (takeWhile1 (flip (>=) (Neg Zero)) (Pos wy198) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy199))) (not (primCmpInt (Pos Zero) (Neg Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];6422 -> 6475[label="",style="solid", color="black", weight=3];
10931[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy252))) (Pos wy253) (iterate (primPlusInt (Pos (Succ wy254))) (primPlusInt (Pos (Succ wy254)) (Pos wy255))) False)\n  Enum a",fontsize=16,color="black",shape="box"];10931 -> 10983[label="",style="solid", color="black", weight=3];
10932[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy252))) (Pos wy253) (iterate (primPlusInt (Pos (Succ wy254))) (primPlusInt (Pos (Succ wy254)) (Pos wy255))) True)\n  Enum a",fontsize=16,color="black",shape="box"];10932 -> 10984[label="",style="solid", color="black", weight=3];
515[label="[]",fontsize=16,color="green",shape="box"];11377[label="wy2780",fontsize=16,color="green",shape="box"];11378[label="wy2770",fontsize=16,color="green",shape="box"];11379 -> 11408[label="",style="dashed", color="red", weight=0];
11379[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy276))) (Pos (primPlusNat (Succ wy2770) (Succ wy279))) (iterate (primPlusInt (Pos (Succ wy2770))) (primPlusInt (Pos (Succ wy2770)) (Pos (primPlusNat (Succ wy2770) (Succ wy279))))) (not (primCmpInt (Pos (primPlusNat (Succ wy2770) (Succ wy279))) (Pos (Succ wy276)) == LT)))\n  Enum a",fontsize=16,color="magenta"];11379 -> 11409[label="",style="dashed", color="magenta", weight=3];
11379 -> 11410[label="",style="dashed", color="magenta", weight=3];
11379 -> 11411[label="",style="dashed", color="magenta", weight=3];
11380 -> 15090[label="",style="dashed", color="red", weight=0];
11380[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy276))) (primMinusNat (Succ wy279) (Succ wy2780)) (iterate (primPlusInt (Neg (Succ wy2780))) (primPlusInt (Neg (Succ wy2780)) (primMinusNat (Succ wy279) (Succ wy2780)))) (not (primCmpInt (primMinusNat (Succ wy279) (Succ wy2780)) (Pos (Succ wy276)) == LT)))\n  Enum a",fontsize=16,color="magenta"];11380 -> 15091[label="",style="dashed", color="magenta", weight=3];
11380 -> 15092[label="",style="dashed", color="magenta", weight=3];
11380 -> 15093[label="",style="dashed", color="magenta", weight=3];
11380 -> 15094[label="",style="dashed", color="magenta", weight=3];
11381 -> 11413[label="",style="dashed", color="red", weight=0];
11381[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy276))) (Pos (primPlusNat Zero (Succ wy279))) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos (primPlusNat Zero (Succ wy279))))) (not (primCmpInt (Pos (primPlusNat Zero (Succ wy279))) (Pos (Succ wy276)) == LT)))\n  Enum a",fontsize=16,color="magenta"];11381 -> 11414[label="",style="dashed", color="magenta", weight=3];
11381 -> 11415[label="",style="dashed", color="magenta", weight=3];
11381 -> 11416[label="",style="dashed", color="magenta", weight=3];
6058[label="primPlusNat (Succ wy1050) (Succ wy1040)",fontsize=16,color="black",shape="box"];6058 -> 6169[label="",style="solid", color="black", weight=3];
6059[label="primPlusNat (Succ wy1050) Zero",fontsize=16,color="black",shape="box"];6059 -> 6170[label="",style="solid", color="black", weight=3];
6060[label="primPlusNat Zero (Succ wy1040)",fontsize=16,color="black",shape="box"];6060 -> 6171[label="",style="solid", color="black", weight=3];
6061[label="primPlusNat Zero Zero",fontsize=16,color="black",shape="box"];6061 -> 6172[label="",style="solid", color="black", weight=3];
6443[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos wy201) (iterate (primPlusInt (Pos (Succ wy1920))) (primPlusInt (Pos (Succ wy1920)) (Pos wy202))) (not (GT == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];6443 -> 6542[label="",style="solid", color="black", weight=3];
6444[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos wy201) (iterate (primPlusInt (Pos (Succ wy1920))) (primPlusInt (Pos (Succ wy1920)) (Pos wy202))) (not False))\n  Enum a",fontsize=16,color="black",shape="triangle"];6444 -> 6543[label="",style="solid", color="black", weight=3];
11271 -> 10944[label="",style="dashed", color="red", weight=0];
11271[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primMinusNat wy2670 wy2680) (iterate (primPlusInt (Neg (Succ wy269))) (primPlusInt (Neg (Succ wy269)) (primMinusNat wy2670 wy2680))) (not (primCmpInt (primMinusNat wy2670 wy2680) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="magenta"];11271 -> 11304[label="",style="dashed", color="magenta", weight=3];
11271 -> 11305[label="",style="dashed", color="magenta", weight=3];
11272[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ wy2670)) (iterate (primPlusInt (Neg (Succ wy269))) (primPlusInt (Neg (Succ wy269)) (Pos (Succ wy2670)))) (not (primCmpInt (Pos (Succ wy2670)) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];11272 -> 11306[label="",style="solid", color="black", weight=3];
11273[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Neg (Succ wy2680)) (iterate (primPlusInt (Neg (Succ wy269))) (primPlusInt (Neg (Succ wy269)) (Neg (Succ wy2680)))) (not (primCmpInt (Neg (Succ wy2680)) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];11273 -> 11307[label="",style="solid", color="black", weight=3];
11274[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos Zero) (iterate (primPlusInt (Neg (Succ wy269))) (primPlusInt (Neg (Succ wy269)) (Pos Zero))) (not (primCmpInt (Pos Zero) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];11274 -> 11308[label="",style="solid", color="black", weight=3];
6449[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos wy204) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy205))) (not (GT == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];6449 -> 6549[label="",style="solid", color="black", weight=3];
6450[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos wy204) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy205))) (not False))\n  Enum a",fontsize=16,color="black",shape="triangle"];6450 -> 6550[label="",style="solid", color="black", weight=3];
10933[label="map toEnum (takeWhile0 (flip (<=) (Pos (Succ wy246))) (Pos wy247) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy248))) otherwise)\n  Enum a",fontsize=16,color="black",shape="box"];10933 -> 10985[label="",style="solid", color="black", weight=3];
10934[label="map toEnum (Pos wy247 : takeWhile (flip (<=) (Pos (Succ wy246))) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy248))))\n  Enum a",fontsize=16,color="black",shape="box"];10934 -> 10986[label="",style="solid", color="black", weight=3];
1249[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (primPlusInt (Pos Zero) (Pos Zero)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos Zero)))) ((<=) primPlusInt (Pos Zero) (Pos Zero) Pos Zero))",fontsize=16,color="black",shape="box"];1249 -> 1329[label="",style="solid", color="black", weight=3];
10344[label="wy2380",fontsize=16,color="green",shape="box"];10345[label="wy2390",fontsize=16,color="green",shape="box"];10346 -> 5492[label="",style="dashed", color="red", weight=0];
10346[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy237))) (Pos (primPlusNat (Succ wy2380) (Succ wy240))) (iterate (primPlusInt (Pos (Succ wy2380))) (primPlusInt (Pos (Succ wy2380)) (Pos (primPlusNat (Succ wy2380) (Succ wy240))))) (not (primCmpInt (Pos (primPlusNat (Succ wy2380) (Succ wy240))) (Pos (Succ wy237)) == GT)))\n  Enum a",fontsize=16,color="magenta"];10346 -> 10519[label="",style="dashed", color="magenta", weight=3];
10346 -> 10520[label="",style="dashed", color="magenta", weight=3];
10346 -> 10521[label="",style="dashed", color="magenta", weight=3];
10346 -> 10522[label="",style="dashed", color="magenta", weight=3];
10346 -> 10523[label="",style="dashed", color="magenta", weight=3];
10347 -> 13967[label="",style="dashed", color="red", weight=0];
10347[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy237))) (primMinusNat (Succ wy240) (Succ wy2390)) (iterate (primPlusInt (Neg (Succ wy2390))) (primPlusInt (Neg (Succ wy2390)) (primMinusNat (Succ wy240) (Succ wy2390)))) (not (primCmpInt (primMinusNat (Succ wy240) (Succ wy2390)) (Pos (Succ wy237)) == GT)))\n  Enum a",fontsize=16,color="magenta"];10347 -> 13968[label="",style="dashed", color="magenta", weight=3];
10347 -> 13969[label="",style="dashed", color="magenta", weight=3];
10347 -> 13970[label="",style="dashed", color="magenta", weight=3];
10347 -> 13971[label="",style="dashed", color="magenta", weight=3];
10348 -> 5580[label="",style="dashed", color="red", weight=0];
10348[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy237))) (Pos (primPlusNat Zero (Succ wy240))) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos (primPlusNat Zero (Succ wy240))))) (not (primCmpInt (Pos (primPlusNat Zero (Succ wy240))) (Pos (Succ wy237)) == GT)))\n  Enum a",fontsize=16,color="magenta"];10348 -> 10525[label="",style="dashed", color="magenta", weight=3];
10348 -> 10526[label="",style="dashed", color="magenta", weight=3];
10348 -> 10527[label="",style="dashed", color="magenta", weight=3];
10348 -> 10528[label="",style="dashed", color="magenta", weight=3];
6466[label="map toEnum (takeWhile1 (flip (>=) (Neg wy187)) (Pos wy195) (iterate (primPlusInt (Pos (Succ wy1880))) (primPlusInt (Pos (Succ wy1880)) (Pos wy196))) (not False))\n  Enum a",fontsize=16,color="black",shape="triangle"];6466 -> 6567[label="",style="solid", color="black", weight=3];
6467 -> 6413[label="",style="dashed", color="red", weight=0];
6467[label="map toEnum (takeWhile1 (flip (>=) (Neg (Succ wy1870))) (Pos wy195) (iterate (primPlusInt (Pos (Succ wy1880))) (primPlusInt (Pos (Succ wy1880)) (Pos wy196))) (not (GT == LT)))\n  Enum a",fontsize=16,color="magenta"];6467 -> 6568[label="",style="dashed", color="magenta", weight=3];
6468[label="map toEnum (takeWhile1 (flip (>=) (Neg Zero)) (Pos wy195) (iterate (primPlusInt (Pos (Succ wy1880))) (primPlusInt (Pos (Succ wy1880)) (Pos wy196))) (not (EQ == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];6468 -> 6569[label="",style="solid", color="black", weight=3];
11300 -> 11139[label="",style="dashed", color="red", weight=0];
11300[label="map toEnum (takeWhile1 (flip (>=) (Neg wy271)) (primMinusNat wy2720 wy2730) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (primMinusNat wy2720 wy2730))) (not (primCmpInt (primMinusNat wy2720 wy2730) (Neg wy271) == LT)))\n  Enum a",fontsize=16,color="magenta"];11300 -> 11344[label="",style="dashed", color="magenta", weight=3];
11300 -> 11345[label="",style="dashed", color="magenta", weight=3];
11301[label="map toEnum (takeWhile1 (flip (>=) (Neg wy271)) (Pos (Succ wy2720)) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (Pos (Succ wy2720)))) (not (primCmpInt (Pos (Succ wy2720)) (Neg wy271) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];11301 -> 11346[label="",style="solid", color="black", weight=3];
11302[label="map toEnum (takeWhile1 (flip (>=) (Neg wy271)) (Neg (Succ wy2730)) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (Neg (Succ wy2730)))) (not (primCmpInt (Neg (Succ wy2730)) (Neg wy271) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];11302 -> 11347[label="",style="solid", color="black", weight=3];
11303[label="map toEnum (takeWhile1 (flip (>=) (Neg wy271)) (Pos Zero) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (Pos Zero))) (not (primCmpInt (Pos Zero) (Neg wy271) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];18571[label="wy271/Succ wy2710",fontsize=10,color="white",style="solid",shape="box"];11303 -> 18571[label="",style="solid", color="burlywood", weight=9];
18571 -> 11348[label="",style="solid", color="burlywood", weight=3];
18572[label="wy271/Zero",fontsize=10,color="white",style="solid",shape="box"];11303 -> 18572[label="",style="solid", color="burlywood", weight=9];
18572 -> 11349[label="",style="solid", color="burlywood", weight=3];
6473[label="map toEnum (takeWhile1 (flip (>=) (Neg wy187)) (Pos wy198) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy199))) (not False))\n  Enum a",fontsize=16,color="black",shape="triangle"];6473 -> 6576[label="",style="solid", color="black", weight=3];
6474 -> 6420[label="",style="dashed", color="red", weight=0];
6474[label="map toEnum (takeWhile1 (flip (>=) (Neg (Succ wy1870))) (Pos wy198) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy199))) (not (GT == LT)))\n  Enum a",fontsize=16,color="magenta"];6474 -> 6577[label="",style="dashed", color="magenta", weight=3];
6475[label="map toEnum (takeWhile1 (flip (>=) (Neg Zero)) (Pos wy198) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy199))) (not (EQ == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];6475 -> 6578[label="",style="solid", color="black", weight=3];
10983[label="map toEnum (takeWhile0 (flip (<=) (Pos (Succ wy252))) (Pos wy253) (iterate (primPlusInt (Pos (Succ wy254))) (primPlusInt (Pos (Succ wy254)) (Pos wy255))) otherwise)\n  Enum a",fontsize=16,color="black",shape="box"];10983 -> 11206[label="",style="solid", color="black", weight=3];
10984[label="map toEnum (Pos wy253 : takeWhile (flip (<=) (Pos (Succ wy252))) (iterate (primPlusInt (Pos (Succ wy254))) (primPlusInt (Pos (Succ wy254)) (Pos wy255))))\n  Enum a",fontsize=16,color="black",shape="box"];10984 -> 11207[label="",style="solid", color="black", weight=3];
11409 -> 5172[label="",style="dashed", color="red", weight=0];
11409[label="primPlusNat (Succ wy2770) (Succ wy279)",fontsize=16,color="magenta"];11409 -> 11417[label="",style="dashed", color="magenta", weight=3];
11409 -> 11418[label="",style="dashed", color="magenta", weight=3];
11410 -> 5172[label="",style="dashed", color="red", weight=0];
11410[label="primPlusNat (Succ wy2770) (Succ wy279)",fontsize=16,color="magenta"];11410 -> 11419[label="",style="dashed", color="magenta", weight=3];
11410 -> 11420[label="",style="dashed", color="magenta", weight=3];
11411 -> 5172[label="",style="dashed", color="red", weight=0];
11411[label="primPlusNat (Succ wy2770) (Succ wy279)",fontsize=16,color="magenta"];11411 -> 11421[label="",style="dashed", color="magenta", weight=3];
11411 -> 11422[label="",style="dashed", color="magenta", weight=3];
11408[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy276))) (Pos wy280) (iterate (primPlusInt (Pos (Succ wy2770))) (primPlusInt (Pos (Succ wy2770)) (Pos wy281))) (not (primCmpInt (Pos wy282) (Pos (Succ wy276)) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];18577[label="wy282/Succ wy2820",fontsize=10,color="white",style="solid",shape="box"];11408 -> 18577[label="",style="solid", color="burlywood", weight=9];
18577 -> 11423[label="",style="solid", color="burlywood", weight=3];
18578[label="wy282/Zero",fontsize=10,color="white",style="solid",shape="box"];11408 -> 18578[label="",style="solid", color="burlywood", weight=9];
18578 -> 11424[label="",style="solid", color="burlywood", weight=3];
15091[label="Succ wy2780",fontsize=16,color="green",shape="box"];15092[label="Succ wy279",fontsize=16,color="green",shape="box"];15093[label="wy276",fontsize=16,color="green",shape="box"];15094[label="wy2780",fontsize=16,color="green",shape="box"];15090[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy323))) (primMinusNat wy324 wy325) (iterate (primPlusInt (Neg (Succ wy326))) (primPlusInt (Neg (Succ wy326)) (primMinusNat wy324 wy325))) (not (primCmpInt (primMinusNat wy324 wy325) (Pos (Succ wy323)) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];18579[label="wy324/Succ wy3240",fontsize=10,color="white",style="solid",shape="box"];15090 -> 18579[label="",style="solid", color="burlywood", weight=9];
18579 -> 15131[label="",style="solid", color="burlywood", weight=3];
18580[label="wy324/Zero",fontsize=10,color="white",style="solid",shape="box"];15090 -> 18580[label="",style="solid", color="burlywood", weight=9];
18580 -> 15132[label="",style="solid", color="burlywood", weight=3];
11414 -> 5172[label="",style="dashed", color="red", weight=0];
11414[label="primPlusNat Zero (Succ wy279)",fontsize=16,color="magenta"];11414 -> 11427[label="",style="dashed", color="magenta", weight=3];
11414 -> 11428[label="",style="dashed", color="magenta", weight=3];
11415 -> 5172[label="",style="dashed", color="red", weight=0];
11415[label="primPlusNat Zero (Succ wy279)",fontsize=16,color="magenta"];11415 -> 11429[label="",style="dashed", color="magenta", weight=3];
11415 -> 11430[label="",style="dashed", color="magenta", weight=3];
11416 -> 5172[label="",style="dashed", color="red", weight=0];
11416[label="primPlusNat Zero (Succ wy279)",fontsize=16,color="magenta"];11416 -> 11431[label="",style="dashed", color="magenta", weight=3];
11416 -> 11432[label="",style="dashed", color="magenta", weight=3];
11413[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy276))) (Pos wy283) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy284))) (not (primCmpInt (Pos wy285) (Pos (Succ wy276)) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];18584[label="wy285/Succ wy2850",fontsize=10,color="white",style="solid",shape="box"];11413 -> 18584[label="",style="solid", color="burlywood", weight=9];
18584 -> 11433[label="",style="solid", color="burlywood", weight=3];
18585[label="wy285/Zero",fontsize=10,color="white",style="solid",shape="box"];11413 -> 18585[label="",style="solid", color="burlywood", weight=9];
18585 -> 11434[label="",style="solid", color="burlywood", weight=3];
6169[label="Succ (Succ (primPlusNat wy1050 wy1040))",fontsize=16,color="green",shape="box"];6169 -> 6263[label="",style="dashed", color="green", weight=3];
6170[label="Succ wy1050",fontsize=16,color="green",shape="box"];6171[label="Succ wy1040",fontsize=16,color="green",shape="box"];6172[label="Zero",fontsize=16,color="green",shape="box"];6542 -> 6444[label="",style="dashed", color="red", weight=0];
6542[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos wy201) (iterate (primPlusInt (Pos (Succ wy1920))) (primPlusInt (Pos (Succ wy1920)) (Pos wy202))) (not False))\n  Enum a",fontsize=16,color="magenta"];6543[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos wy201) (iterate (primPlusInt (Pos (Succ wy1920))) (primPlusInt (Pos (Succ wy1920)) (Pos wy202))) True)\n  Enum a",fontsize=16,color="black",shape="box"];6543 -> 6617[label="",style="solid", color="black", weight=3];
11304[label="wy2670",fontsize=16,color="green",shape="box"];11305[label="wy2680",fontsize=16,color="green",shape="box"];11306[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ wy2670)) (iterate (primPlusInt (Neg (Succ wy269))) (primPlusInt (Neg (Succ wy269)) (Pos (Succ wy2670)))) (not (primCmpNat (Succ wy2670) Zero == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];11306 -> 11350[label="",style="solid", color="black", weight=3];
11307[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Neg (Succ wy2680)) (iterate (primPlusInt (Neg (Succ wy269))) (primPlusInt (Neg (Succ wy269)) (Neg (Succ wy2680)))) (not (LT == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];11307 -> 11351[label="",style="solid", color="black", weight=3];
11308[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos Zero) (iterate (primPlusInt (Neg (Succ wy269))) (primPlusInt (Neg (Succ wy269)) (Pos Zero))) (not (EQ == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];11308 -> 11352[label="",style="solid", color="black", weight=3];
6549 -> 6450[label="",style="dashed", color="red", weight=0];
6549[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos wy204) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy205))) (not False))\n  Enum a",fontsize=16,color="magenta"];6550[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos wy204) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy205))) True)\n  Enum a",fontsize=16,color="black",shape="box"];6550 -> 6625[label="",style="solid", color="black", weight=3];
10985[label="map toEnum (takeWhile0 (flip (<=) (Pos (Succ wy246))) (Pos wy247) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy248))) True)\n  Enum a",fontsize=16,color="black",shape="box"];10985 -> 11208[label="",style="solid", color="black", weight=3];
10986[label="toEnum (Pos wy247) : map toEnum (takeWhile (flip (<=) (Pos (Succ wy246))) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy248))))\n  Enum a",fontsize=16,color="green",shape="box"];10986 -> 11209[label="",style="dashed", color="green", weight=3];
10986 -> 11210[label="",style="dashed", color="green", weight=3];
1329[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (primPlusInt (Pos Zero) (Pos Zero)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos Zero)))) (compare (primPlusInt (Pos Zero) (Pos Zero)) (Pos Zero) /= GT))",fontsize=16,color="black",shape="box"];1329 -> 1432[label="",style="solid", color="black", weight=3];
10519 -> 5172[label="",style="dashed", color="red", weight=0];
10519[label="primPlusNat (Succ wy2380) (Succ wy240)",fontsize=16,color="magenta"];10519 -> 10552[label="",style="dashed", color="magenta", weight=3];
10519 -> 10553[label="",style="dashed", color="magenta", weight=3];
10520[label="wy2380",fontsize=16,color="green",shape="box"];10521[label="wy237",fontsize=16,color="green",shape="box"];10522 -> 5172[label="",style="dashed", color="red", weight=0];
10522[label="primPlusNat (Succ wy2380) (Succ wy240)",fontsize=16,color="magenta"];10522 -> 10554[label="",style="dashed", color="magenta", weight=3];
10522 -> 10555[label="",style="dashed", color="magenta", weight=3];
10523 -> 5172[label="",style="dashed", color="red", weight=0];
10523[label="primPlusNat (Succ wy2380) (Succ wy240)",fontsize=16,color="magenta"];10523 -> 10556[label="",style="dashed", color="magenta", weight=3];
10523 -> 10557[label="",style="dashed", color="magenta", weight=3];
13968[label="Succ wy2390",fontsize=16,color="green",shape="box"];13969[label="wy2390",fontsize=16,color="green",shape="box"];13970[label="Succ wy240",fontsize=16,color="green",shape="box"];13971[label="wy237",fontsize=16,color="green",shape="box"];13967[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy306))) (primMinusNat wy307 wy308) (iterate (primPlusInt (Neg (Succ wy309))) (primPlusInt (Neg (Succ wy309)) (primMinusNat wy307 wy308))) (not (primCmpInt (primMinusNat wy307 wy308) (Pos (Succ wy306)) == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];18591[label="wy307/Succ wy3070",fontsize=10,color="white",style="solid",shape="box"];13967 -> 18591[label="",style="solid", color="burlywood", weight=9];
18591 -> 14020[label="",style="solid", color="burlywood", weight=3];
18592[label="wy307/Zero",fontsize=10,color="white",style="solid",shape="box"];13967 -> 18592[label="",style="solid", color="burlywood", weight=9];
18592 -> 14021[label="",style="solid", color="burlywood", weight=3];
10525 -> 5172[label="",style="dashed", color="red", weight=0];
10525[label="primPlusNat Zero (Succ wy240)",fontsize=16,color="magenta"];10525 -> 10560[label="",style="dashed", color="magenta", weight=3];
10525 -> 10561[label="",style="dashed", color="magenta", weight=3];
10526 -> 5172[label="",style="dashed", color="red", weight=0];
10526[label="primPlusNat Zero (Succ wy240)",fontsize=16,color="magenta"];10526 -> 10562[label="",style="dashed", color="magenta", weight=3];
10526 -> 10563[label="",style="dashed", color="magenta", weight=3];
10527[label="wy237",fontsize=16,color="green",shape="box"];10528 -> 5172[label="",style="dashed", color="red", weight=0];
10528[label="primPlusNat Zero (Succ wy240)",fontsize=16,color="magenta"];10528 -> 10564[label="",style="dashed", color="magenta", weight=3];
10528 -> 10565[label="",style="dashed", color="magenta", weight=3];
6567[label="map toEnum (takeWhile1 (flip (>=) (Neg wy187)) (Pos wy195) (iterate (primPlusInt (Pos (Succ wy1880))) (primPlusInt (Pos (Succ wy1880)) (Pos wy196))) True)\n  Enum a",fontsize=16,color="black",shape="box"];6567 -> 6634[label="",style="solid", color="black", weight=3];
6568[label="Succ wy1870",fontsize=16,color="green",shape="box"];6569 -> 6466[label="",style="dashed", color="red", weight=0];
6569[label="map toEnum (takeWhile1 (flip (>=) (Neg Zero)) (Pos wy195) (iterate (primPlusInt (Pos (Succ wy1880))) (primPlusInt (Pos (Succ wy1880)) (Pos wy196))) (not False))\n  Enum a",fontsize=16,color="magenta"];6569 -> 6635[label="",style="dashed", color="magenta", weight=3];
11344[label="wy2720",fontsize=16,color="green",shape="box"];11345[label="wy2730",fontsize=16,color="green",shape="box"];11346[label="map toEnum (takeWhile1 (flip (>=) (Neg wy271)) (Pos (Succ wy2720)) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (Pos (Succ wy2720)))) (not (GT == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];11346 -> 11382[label="",style="solid", color="black", weight=3];
11347[label="map toEnum (takeWhile1 (flip (>=) (Neg wy271)) (Neg (Succ wy2730)) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (Neg (Succ wy2730)))) (not (primCmpNat wy271 (Succ wy2730) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];18597[label="wy271/Succ wy2710",fontsize=10,color="white",style="solid",shape="box"];11347 -> 18597[label="",style="solid", color="burlywood", weight=9];
18597 -> 11383[label="",style="solid", color="burlywood", weight=3];
18598[label="wy271/Zero",fontsize=10,color="white",style="solid",shape="box"];11347 -> 18598[label="",style="solid", color="burlywood", weight=9];
18598 -> 11384[label="",style="solid", color="burlywood", weight=3];
11348[label="map toEnum (takeWhile1 (flip (>=) (Neg (Succ wy2710))) (Pos Zero) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (Pos Zero))) (not (primCmpInt (Pos Zero) (Neg (Succ wy2710)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];11348 -> 11385[label="",style="solid", color="black", weight=3];
11349[label="map toEnum (takeWhile1 (flip (>=) (Neg Zero)) (Pos Zero) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (Pos Zero))) (not (primCmpInt (Pos Zero) (Neg Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];11349 -> 11386[label="",style="solid", color="black", weight=3];
6576[label="map toEnum (takeWhile1 (flip (>=) (Neg wy187)) (Pos wy198) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy199))) True)\n  Enum a",fontsize=16,color="black",shape="box"];6576 -> 6645[label="",style="solid", color="black", weight=3];
6577[label="Succ wy1870",fontsize=16,color="green",shape="box"];6578 -> 6473[label="",style="dashed", color="red", weight=0];
6578[label="map toEnum (takeWhile1 (flip (>=) (Neg Zero)) (Pos wy198) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy199))) (not False))\n  Enum a",fontsize=16,color="magenta"];6578 -> 6646[label="",style="dashed", color="magenta", weight=3];
11206[label="map toEnum (takeWhile0 (flip (<=) (Pos (Succ wy252))) (Pos wy253) (iterate (primPlusInt (Pos (Succ wy254))) (primPlusInt (Pos (Succ wy254)) (Pos wy255))) True)\n  Enum a",fontsize=16,color="black",shape="box"];11206 -> 11275[label="",style="solid", color="black", weight=3];
11207[label="toEnum (Pos wy253) : map toEnum (takeWhile (flip (<=) (Pos (Succ wy252))) (iterate (primPlusInt (Pos (Succ wy254))) (primPlusInt (Pos (Succ wy254)) (Pos wy255))))\n  Enum a",fontsize=16,color="green",shape="box"];11207 -> 11276[label="",style="dashed", color="green", weight=3];
11207 -> 11277[label="",style="dashed", color="green", weight=3];
11417[label="Succ wy279",fontsize=16,color="green",shape="box"];11418[label="Succ wy2770",fontsize=16,color="green",shape="box"];11419[label="Succ wy279",fontsize=16,color="green",shape="box"];11420[label="Succ wy2770",fontsize=16,color="green",shape="box"];11421[label="Succ wy279",fontsize=16,color="green",shape="box"];11422[label="Succ wy2770",fontsize=16,color="green",shape="box"];11423[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy276))) (Pos wy280) (iterate (primPlusInt (Pos (Succ wy2770))) (primPlusInt (Pos (Succ wy2770)) (Pos wy281))) (not (primCmpInt (Pos (Succ wy2820)) (Pos (Succ wy276)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];11423 -> 11475[label="",style="solid", color="black", weight=3];
11424[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy276))) (Pos wy280) (iterate (primPlusInt (Pos (Succ wy2770))) (primPlusInt (Pos (Succ wy2770)) (Pos wy281))) (not (primCmpInt (Pos Zero) (Pos (Succ wy276)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];11424 -> 11476[label="",style="solid", color="black", weight=3];
15131[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy323))) (primMinusNat (Succ wy3240) wy325) (iterate (primPlusInt (Neg (Succ wy326))) (primPlusInt (Neg (Succ wy326)) (primMinusNat (Succ wy3240) wy325))) (not (primCmpInt (primMinusNat (Succ wy3240) wy325) (Pos (Succ wy323)) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];18600[label="wy325/Succ wy3250",fontsize=10,color="white",style="solid",shape="box"];15131 -> 18600[label="",style="solid", color="burlywood", weight=9];
18600 -> 15213[label="",style="solid", color="burlywood", weight=3];
18601[label="wy325/Zero",fontsize=10,color="white",style="solid",shape="box"];15131 -> 18601[label="",style="solid", color="burlywood", weight=9];
18601 -> 15214[label="",style="solid", color="burlywood", weight=3];
15132[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy323))) (primMinusNat Zero wy325) (iterate (primPlusInt (Neg (Succ wy326))) (primPlusInt (Neg (Succ wy326)) (primMinusNat Zero wy325))) (not (primCmpInt (primMinusNat Zero wy325) (Pos (Succ wy323)) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];18602[label="wy325/Succ wy3250",fontsize=10,color="white",style="solid",shape="box"];15132 -> 18602[label="",style="solid", color="burlywood", weight=9];
18602 -> 15215[label="",style="solid", color="burlywood", weight=3];
18603[label="wy325/Zero",fontsize=10,color="white",style="solid",shape="box"];15132 -> 18603[label="",style="solid", color="burlywood", weight=9];
18603 -> 15216[label="",style="solid", color="burlywood", weight=3];
11427[label="Succ wy279",fontsize=16,color="green",shape="box"];11428[label="Zero",fontsize=16,color="green",shape="box"];11429[label="Succ wy279",fontsize=16,color="green",shape="box"];11430[label="Zero",fontsize=16,color="green",shape="box"];11431[label="Succ wy279",fontsize=16,color="green",shape="box"];11432[label="Zero",fontsize=16,color="green",shape="box"];11433[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy276))) (Pos wy283) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy284))) (not (primCmpInt (Pos (Succ wy2850)) (Pos (Succ wy276)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];11433 -> 11481[label="",style="solid", color="black", weight=3];
11434[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy276))) (Pos wy283) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy284))) (not (primCmpInt (Pos Zero) (Pos (Succ wy276)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];11434 -> 11482[label="",style="solid", color="black", weight=3];
6263 -> 5172[label="",style="dashed", color="red", weight=0];
6263[label="primPlusNat wy1050 wy1040",fontsize=16,color="magenta"];6263 -> 6310[label="",style="dashed", color="magenta", weight=3];
6263 -> 6311[label="",style="dashed", color="magenta", weight=3];
6617[label="map toEnum (Pos wy201 : takeWhile (flip (>=) (Pos Zero)) (iterate (primPlusInt (Pos (Succ wy1920))) (primPlusInt (Pos (Succ wy1920)) (Pos wy202))))\n  Enum a",fontsize=16,color="black",shape="box"];6617 -> 6701[label="",style="solid", color="black", weight=3];
11350[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ wy2670)) (iterate (primPlusInt (Neg (Succ wy269))) (primPlusInt (Neg (Succ wy269)) (Pos (Succ wy2670)))) (not (GT == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];11350 -> 11387[label="",style="solid", color="black", weight=3];
11351[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Neg (Succ wy2680)) (iterate (primPlusInt (Neg (Succ wy269))) (primPlusInt (Neg (Succ wy269)) (Neg (Succ wy2680)))) (not True))\n  Enum a",fontsize=16,color="black",shape="box"];11351 -> 11388[label="",style="solid", color="black", weight=3];
11352[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos Zero) (iterate (primPlusInt (Neg (Succ wy269))) (primPlusInt (Neg (Succ wy269)) (Pos Zero))) (not False))\n  Enum a",fontsize=16,color="black",shape="box"];11352 -> 11389[label="",style="solid", color="black", weight=3];
6625[label="map toEnum (Pos wy204 : takeWhile (flip (>=) (Pos Zero)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy205))))\n  Enum a",fontsize=16,color="black",shape="box"];6625 -> 6709[label="",style="solid", color="black", weight=3];
11208 -> 1285[label="",style="dashed", color="red", weight=0];
11208[label="map toEnum []\n  Enum a",fontsize=16,color="magenta"];11209[label="toEnum (Pos wy247)\n  Enum a",fontsize=16,color="blue",shape="box"];18606[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];11209 -> 18606[label="",style="solid", color="blue", weight=9];
18606 -> 11278[label="",style="solid", color="blue", weight=3];
18607[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];11209 -> 18607[label="",style="solid", color="blue", weight=9];
18607 -> 11279[label="",style="solid", color="blue", weight=3];
18608[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];11209 -> 18608[label="",style="solid", color="blue", weight=9];
18608 -> 11280[label="",style="solid", color="blue", weight=3];
18609[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];11209 -> 18609[label="",style="solid", color="blue", weight=9];
18609 -> 11281[label="",style="solid", color="blue", weight=3];
18610[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];11209 -> 18610[label="",style="solid", color="blue", weight=9];
18610 -> 11282[label="",style="solid", color="blue", weight=3];
18611[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];11209 -> 18611[label="",style="solid", color="blue", weight=9];
18611 -> 11283[label="",style="solid", color="blue", weight=3];
18612[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];11209 -> 18612[label="",style="solid", color="blue", weight=9];
18612 -> 11284[label="",style="solid", color="blue", weight=3];
18613[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];11209 -> 18613[label="",style="solid", color="blue", weight=9];
18613 -> 11285[label="",style="solid", color="blue", weight=3];
18614[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];11209 -> 18614[label="",style="solid", color="blue", weight=9];
18614 -> 11286[label="",style="solid", color="blue", weight=3];
11210[label="map toEnum (takeWhile (flip (<=) (Pos (Succ wy246))) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy248))))\n  Enum a",fontsize=16,color="black",shape="box"];11210 -> 11287[label="",style="solid", color="black", weight=3];
1432[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (primPlusInt (Pos Zero) (Pos Zero)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos Zero)))) (not (compare (primPlusInt (Pos Zero) (Pos Zero)) (Pos Zero) == GT)))",fontsize=16,color="black",shape="box"];1432 -> 1482[label="",style="solid", color="black", weight=3];
10552[label="Succ wy240",fontsize=16,color="green",shape="box"];10553[label="Succ wy2380",fontsize=16,color="green",shape="box"];10554[label="Succ wy240",fontsize=16,color="green",shape="box"];10555[label="Succ wy2380",fontsize=16,color="green",shape="box"];10556[label="Succ wy240",fontsize=16,color="green",shape="box"];10557[label="Succ wy2380",fontsize=16,color="green",shape="box"];14020[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy306))) (primMinusNat (Succ wy3070) wy308) (iterate (primPlusInt (Neg (Succ wy309))) (primPlusInt (Neg (Succ wy309)) (primMinusNat (Succ wy3070) wy308))) (not (primCmpInt (primMinusNat (Succ wy3070) wy308) (Pos (Succ wy306)) == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];18615[label="wy308/Succ wy3080",fontsize=10,color="white",style="solid",shape="box"];14020 -> 18615[label="",style="solid", color="burlywood", weight=9];
18615 -> 14125[label="",style="solid", color="burlywood", weight=3];
18616[label="wy308/Zero",fontsize=10,color="white",style="solid",shape="box"];14020 -> 18616[label="",style="solid", color="burlywood", weight=9];
18616 -> 14126[label="",style="solid", color="burlywood", weight=3];
14021[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy306))) (primMinusNat Zero wy308) (iterate (primPlusInt (Neg (Succ wy309))) (primPlusInt (Neg (Succ wy309)) (primMinusNat Zero wy308))) (not (primCmpInt (primMinusNat Zero wy308) (Pos (Succ wy306)) == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];18617[label="wy308/Succ wy3080",fontsize=10,color="white",style="solid",shape="box"];14021 -> 18617[label="",style="solid", color="burlywood", weight=9];
18617 -> 14127[label="",style="solid", color="burlywood", weight=3];
18618[label="wy308/Zero",fontsize=10,color="white",style="solid",shape="box"];14021 -> 18618[label="",style="solid", color="burlywood", weight=9];
18618 -> 14128[label="",style="solid", color="burlywood", weight=3];
10560[label="Succ wy240",fontsize=16,color="green",shape="box"];10561[label="Zero",fontsize=16,color="green",shape="box"];10562[label="Succ wy240",fontsize=16,color="green",shape="box"];10563[label="Zero",fontsize=16,color="green",shape="box"];10564[label="Succ wy240",fontsize=16,color="green",shape="box"];10565[label="Zero",fontsize=16,color="green",shape="box"];6634[label="map toEnum (Pos wy195 : takeWhile (flip (>=) (Neg wy187)) (iterate (primPlusInt (Pos (Succ wy1880))) (primPlusInt (Pos (Succ wy1880)) (Pos wy196))))\n  Enum a",fontsize=16,color="black",shape="box"];6634 -> 6716[label="",style="solid", color="black", weight=3];
6635[label="Zero",fontsize=16,color="green",shape="box"];11382[label="map toEnum (takeWhile1 (flip (>=) (Neg wy271)) (Pos (Succ wy2720)) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (Pos (Succ wy2720)))) (not False))\n  Enum a",fontsize=16,color="black",shape="box"];11382 -> 11435[label="",style="solid", color="black", weight=3];
11383[label="map toEnum (takeWhile1 (flip (>=) (Neg (Succ wy2710))) (Neg (Succ wy2730)) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (Neg (Succ wy2730)))) (not (primCmpNat (Succ wy2710) (Succ wy2730) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];11383 -> 11436[label="",style="solid", color="black", weight=3];
11384[label="map toEnum (takeWhile1 (flip (>=) (Neg Zero)) (Neg (Succ wy2730)) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (Neg (Succ wy2730)))) (not (primCmpNat Zero (Succ wy2730) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];11384 -> 11437[label="",style="solid", color="black", weight=3];
11385[label="map toEnum (takeWhile1 (flip (>=) (Neg (Succ wy2710))) (Pos Zero) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (Pos Zero))) (not (GT == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];11385 -> 11438[label="",style="solid", color="black", weight=3];
11386[label="map toEnum (takeWhile1 (flip (>=) (Neg Zero)) (Pos Zero) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (Pos Zero))) (not (EQ == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];11386 -> 11439[label="",style="solid", color="black", weight=3];
6645[label="map toEnum (Pos wy198 : takeWhile (flip (>=) (Neg wy187)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy199))))\n  Enum a",fontsize=16,color="black",shape="box"];6645 -> 6726[label="",style="solid", color="black", weight=3];
6646[label="Zero",fontsize=16,color="green",shape="box"];11275 -> 1285[label="",style="dashed", color="red", weight=0];
11275[label="map toEnum []\n  Enum a",fontsize=16,color="magenta"];11276[label="toEnum (Pos wy253)\n  Enum a",fontsize=16,color="blue",shape="box"];18620[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];11276 -> 18620[label="",style="solid", color="blue", weight=9];
18620 -> 11309[label="",style="solid", color="blue", weight=3];
18621[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];11276 -> 18621[label="",style="solid", color="blue", weight=9];
18621 -> 11310[label="",style="solid", color="blue", weight=3];
18622[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];11276 -> 18622[label="",style="solid", color="blue", weight=9];
18622 -> 11311[label="",style="solid", color="blue", weight=3];
18623[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];11276 -> 18623[label="",style="solid", color="blue", weight=9];
18623 -> 11312[label="",style="solid", color="blue", weight=3];
18624[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];11276 -> 18624[label="",style="solid", color="blue", weight=9];
18624 -> 11313[label="",style="solid", color="blue", weight=3];
18625[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];11276 -> 18625[label="",style="solid", color="blue", weight=9];
18625 -> 11314[label="",style="solid", color="blue", weight=3];
18626[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];11276 -> 18626[label="",style="solid", color="blue", weight=9];
18626 -> 11315[label="",style="solid", color="blue", weight=3];
18627[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];11276 -> 18627[label="",style="solid", color="blue", weight=9];
18627 -> 11316[label="",style="solid", color="blue", weight=3];
18628[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];11276 -> 18628[label="",style="solid", color="blue", weight=9];
18628 -> 11317[label="",style="solid", color="blue", weight=3];
11277[label="map toEnum (takeWhile (flip (<=) (Pos (Succ wy252))) (iterate (primPlusInt (Pos (Succ wy254))) (primPlusInt (Pos (Succ wy254)) (Pos wy255))))\n  Enum a",fontsize=16,color="black",shape="box"];11277 -> 11318[label="",style="solid", color="black", weight=3];
11475 -> 15540[label="",style="dashed", color="red", weight=0];
11475[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy276))) (Pos wy280) (iterate (primPlusInt (Pos (Succ wy2770))) (primPlusInt (Pos (Succ wy2770)) (Pos wy281))) (not (primCmpNat (Succ wy2820) (Succ wy276) == LT)))\n  Enum a",fontsize=16,color="magenta"];11475 -> 15541[label="",style="dashed", color="magenta", weight=3];
11475 -> 15542[label="",style="dashed", color="magenta", weight=3];
11475 -> 15543[label="",style="dashed", color="magenta", weight=3];
11475 -> 15544[label="",style="dashed", color="magenta", weight=3];
11475 -> 15545[label="",style="dashed", color="magenta", weight=3];
11475 -> 15546[label="",style="dashed", color="magenta", weight=3];
11476 -> 15540[label="",style="dashed", color="red", weight=0];
11476[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy276))) (Pos wy280) (iterate (primPlusInt (Pos (Succ wy2770))) (primPlusInt (Pos (Succ wy2770)) (Pos wy281))) (not (primCmpNat Zero (Succ wy276) == LT)))\n  Enum a",fontsize=16,color="magenta"];11476 -> 15547[label="",style="dashed", color="magenta", weight=3];
11476 -> 15548[label="",style="dashed", color="magenta", weight=3];
11476 -> 15549[label="",style="dashed", color="magenta", weight=3];
11476 -> 15550[label="",style="dashed", color="magenta", weight=3];
11476 -> 15551[label="",style="dashed", color="magenta", weight=3];
11476 -> 15552[label="",style="dashed", color="magenta", weight=3];
15213[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy323))) (primMinusNat (Succ wy3240) (Succ wy3250)) (iterate (primPlusInt (Neg (Succ wy326))) (primPlusInt (Neg (Succ wy326)) (primMinusNat (Succ wy3240) (Succ wy3250)))) (not (primCmpInt (primMinusNat (Succ wy3240) (Succ wy3250)) (Pos (Succ wy323)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];15213 -> 15283[label="",style="solid", color="black", weight=3];
15214[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy323))) (primMinusNat (Succ wy3240) Zero) (iterate (primPlusInt (Neg (Succ wy326))) (primPlusInt (Neg (Succ wy326)) (primMinusNat (Succ wy3240) Zero))) (not (primCmpInt (primMinusNat (Succ wy3240) Zero) (Pos (Succ wy323)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];15214 -> 15284[label="",style="solid", color="black", weight=3];
15215[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy323))) (primMinusNat Zero (Succ wy3250)) (iterate (primPlusInt (Neg (Succ wy326))) (primPlusInt (Neg (Succ wy326)) (primMinusNat Zero (Succ wy3250)))) (not (primCmpInt (primMinusNat Zero (Succ wy3250)) (Pos (Succ wy323)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];15215 -> 15285[label="",style="solid", color="black", weight=3];
15216[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy323))) (primMinusNat Zero Zero) (iterate (primPlusInt (Neg (Succ wy326))) (primPlusInt (Neg (Succ wy326)) (primMinusNat Zero Zero))) (not (primCmpInt (primMinusNat Zero Zero) (Pos (Succ wy323)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];15216 -> 15286[label="",style="solid", color="black", weight=3];
11481 -> 15745[label="",style="dashed", color="red", weight=0];
11481[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy276))) (Pos wy283) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy284))) (not (primCmpNat (Succ wy2850) (Succ wy276) == LT)))\n  Enum a",fontsize=16,color="magenta"];11481 -> 15746[label="",style="dashed", color="magenta", weight=3];
11481 -> 15747[label="",style="dashed", color="magenta", weight=3];
11481 -> 15748[label="",style="dashed", color="magenta", weight=3];
11481 -> 15749[label="",style="dashed", color="magenta", weight=3];
11481 -> 15750[label="",style="dashed", color="magenta", weight=3];
11482 -> 15745[label="",style="dashed", color="red", weight=0];
11482[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy276))) (Pos wy283) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy284))) (not (primCmpNat Zero (Succ wy276) == LT)))\n  Enum a",fontsize=16,color="magenta"];11482 -> 15751[label="",style="dashed", color="magenta", weight=3];
11482 -> 15752[label="",style="dashed", color="magenta", weight=3];
11482 -> 15753[label="",style="dashed", color="magenta", weight=3];
11482 -> 15754[label="",style="dashed", color="magenta", weight=3];
11482 -> 15755[label="",style="dashed", color="magenta", weight=3];
6310[label="wy1040",fontsize=16,color="green",shape="box"];6311[label="wy1050",fontsize=16,color="green",shape="box"];6701[label="toEnum (Pos wy201) : map toEnum (takeWhile (flip (>=) (Pos Zero)) (iterate (primPlusInt (Pos (Succ wy1920))) (primPlusInt (Pos (Succ wy1920)) (Pos wy202))))\n  Enum a",fontsize=16,color="green",shape="box"];6701 -> 6799[label="",style="dashed", color="green", weight=3];
6701 -> 6800[label="",style="dashed", color="green", weight=3];
11387[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ wy2670)) (iterate (primPlusInt (Neg (Succ wy269))) (primPlusInt (Neg (Succ wy269)) (Pos (Succ wy2670)))) (not False))\n  Enum a",fontsize=16,color="black",shape="box"];11387 -> 11440[label="",style="solid", color="black", weight=3];
11388[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Neg (Succ wy2680)) (iterate (primPlusInt (Neg (Succ wy269))) (primPlusInt (Neg (Succ wy269)) (Neg (Succ wy2680)))) False)\n  Enum a",fontsize=16,color="black",shape="box"];11388 -> 11441[label="",style="solid", color="black", weight=3];
11389[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos Zero) (iterate (primPlusInt (Neg (Succ wy269))) (primPlusInt (Neg (Succ wy269)) (Pos Zero))) True)\n  Enum a",fontsize=16,color="black",shape="box"];11389 -> 11442[label="",style="solid", color="black", weight=3];
6709[label="toEnum (Pos wy204) : map toEnum (takeWhile (flip (>=) (Pos Zero)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy205))))\n  Enum a",fontsize=16,color="green",shape="box"];6709 -> 6809[label="",style="dashed", color="green", weight=3];
6709 -> 6810[label="",style="dashed", color="green", weight=3];
11278 -> 6428[label="",style="dashed", color="red", weight=0];
11278[label="toEnum (Pos wy247)",fontsize=16,color="magenta"];11278 -> 11319[label="",style="dashed", color="magenta", weight=3];
11279 -> 6429[label="",style="dashed", color="red", weight=0];
11279[label="toEnum (Pos wy247)\n  Integral a",fontsize=16,color="magenta"];11279 -> 11320[label="",style="dashed", color="magenta", weight=3];
11280 -> 6430[label="",style="dashed", color="red", weight=0];
11280[label="toEnum (Pos wy247)",fontsize=16,color="magenta"];11280 -> 11321[label="",style="dashed", color="magenta", weight=3];
11281 -> 6431[label="",style="dashed", color="red", weight=0];
11281[label="toEnum (Pos wy247)",fontsize=16,color="magenta"];11281 -> 11322[label="",style="dashed", color="magenta", weight=3];
11282 -> 6432[label="",style="dashed", color="red", weight=0];
11282[label="toEnum (Pos wy247)",fontsize=16,color="magenta"];11282 -> 11323[label="",style="dashed", color="magenta", weight=3];
11283 -> 6433[label="",style="dashed", color="red", weight=0];
11283[label="toEnum (Pos wy247)",fontsize=16,color="magenta"];11283 -> 11324[label="",style="dashed", color="magenta", weight=3];
11284 -> 352[label="",style="dashed", color="red", weight=0];
11284[label="toEnum (Pos wy247)",fontsize=16,color="magenta"];11284 -> 11325[label="",style="dashed", color="magenta", weight=3];
11285 -> 6435[label="",style="dashed", color="red", weight=0];
11285[label="toEnum (Pos wy247)",fontsize=16,color="magenta"];11285 -> 11326[label="",style="dashed", color="magenta", weight=3];
11286 -> 6436[label="",style="dashed", color="red", weight=0];
11286[label="toEnum (Pos wy247)",fontsize=16,color="magenta"];11286 -> 11327[label="",style="dashed", color="magenta", weight=3];
11287[label="map toEnum (takeWhile (flip (<=) (Pos (Succ wy246))) (primPlusInt (Pos Zero) (Pos wy248) : iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos wy248)))))\n  Enum a",fontsize=16,color="black",shape="box"];11287 -> 11328[label="",style="solid", color="black", weight=3];
1482 -> 868[label="",style="dashed", color="red", weight=0];
1482[label="map toEnum (takeWhile1 (flip (<=) (Pos Zero)) (primPlusInt (Pos Zero) (Pos Zero)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos Zero)))) (not (primCmpInt (primPlusInt (Pos Zero) (Pos Zero)) (Pos Zero) == GT)))",fontsize=16,color="magenta"];14125[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy306))) (primMinusNat (Succ wy3070) (Succ wy3080)) (iterate (primPlusInt (Neg (Succ wy309))) (primPlusInt (Neg (Succ wy309)) (primMinusNat (Succ wy3070) (Succ wy3080)))) (not (primCmpInt (primMinusNat (Succ wy3070) (Succ wy3080)) (Pos (Succ wy306)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];14125 -> 14134[label="",style="solid", color="black", weight=3];
14126[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy306))) (primMinusNat (Succ wy3070) Zero) (iterate (primPlusInt (Neg (Succ wy309))) (primPlusInt (Neg (Succ wy309)) (primMinusNat (Succ wy3070) Zero))) (not (primCmpInt (primMinusNat (Succ wy3070) Zero) (Pos (Succ wy306)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];14126 -> 14135[label="",style="solid", color="black", weight=3];
14127[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy306))) (primMinusNat Zero (Succ wy3080)) (iterate (primPlusInt (Neg (Succ wy309))) (primPlusInt (Neg (Succ wy309)) (primMinusNat Zero (Succ wy3080)))) (not (primCmpInt (primMinusNat Zero (Succ wy3080)) (Pos (Succ wy306)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];14127 -> 14136[label="",style="solid", color="black", weight=3];
14128[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy306))) (primMinusNat Zero Zero) (iterate (primPlusInt (Neg (Succ wy309))) (primPlusInt (Neg (Succ wy309)) (primMinusNat Zero Zero))) (not (primCmpInt (primMinusNat Zero Zero) (Pos (Succ wy306)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];14128 -> 14137[label="",style="solid", color="black", weight=3];
6716[label="toEnum (Pos wy195) : map toEnum (takeWhile (flip (>=) (Neg wy187)) (iterate (primPlusInt (Pos (Succ wy1880))) (primPlusInt (Pos (Succ wy1880)) (Pos wy196))))\n  Enum a",fontsize=16,color="green",shape="box"];6716 -> 6818[label="",style="dashed", color="green", weight=3];
6716 -> 6819[label="",style="dashed", color="green", weight=3];
11435[label="map toEnum (takeWhile1 (flip (>=) (Neg wy271)) (Pos (Succ wy2720)) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (Pos (Succ wy2720)))) True)\n  Enum a",fontsize=16,color="black",shape="box"];11435 -> 11483[label="",style="solid", color="black", weight=3];
11436 -> 18113[label="",style="dashed", color="red", weight=0];
11436[label="map toEnum (takeWhile1 (flip (>=) (Neg (Succ wy2710))) (Neg (Succ wy2730)) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (Neg (Succ wy2730)))) (not (primCmpNat wy2710 wy2730 == LT)))\n  Enum a",fontsize=16,color="magenta"];11436 -> 18114[label="",style="dashed", color="magenta", weight=3];
11436 -> 18115[label="",style="dashed", color="magenta", weight=3];
11436 -> 18116[label="",style="dashed", color="magenta", weight=3];
11436 -> 18117[label="",style="dashed", color="magenta", weight=3];
11436 -> 18118[label="",style="dashed", color="magenta", weight=3];
11436 -> 18119[label="",style="dashed", color="magenta", weight=3];
11437[label="map toEnum (takeWhile1 (flip (>=) (Neg Zero)) (Neg (Succ wy2730)) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (Neg (Succ wy2730)))) (not (LT == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];11437 -> 11486[label="",style="solid", color="black", weight=3];
11438[label="map toEnum (takeWhile1 (flip (>=) (Neg (Succ wy2710))) (Pos Zero) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (Pos Zero))) (not False))\n  Enum a",fontsize=16,color="black",shape="box"];11438 -> 11487[label="",style="solid", color="black", weight=3];
11439[label="map toEnum (takeWhile1 (flip (>=) (Neg Zero)) (Pos Zero) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (Pos Zero))) (not False))\n  Enum a",fontsize=16,color="black",shape="box"];11439 -> 11488[label="",style="solid", color="black", weight=3];
6726[label="toEnum (Pos wy198) : map toEnum (takeWhile (flip (>=) (Neg wy187)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy199))))\n  Enum a",fontsize=16,color="green",shape="box"];6726 -> 6832[label="",style="dashed", color="green", weight=3];
6726 -> 6833[label="",style="dashed", color="green", weight=3];
11309 -> 6428[label="",style="dashed", color="red", weight=0];
11309[label="toEnum (Pos wy253)",fontsize=16,color="magenta"];11309 -> 11353[label="",style="dashed", color="magenta", weight=3];
11310 -> 6429[label="",style="dashed", color="red", weight=0];
11310[label="toEnum (Pos wy253)\n  Integral a",fontsize=16,color="magenta"];11310 -> 11354[label="",style="dashed", color="magenta", weight=3];
11311 -> 6430[label="",style="dashed", color="red", weight=0];
11311[label="toEnum (Pos wy253)",fontsize=16,color="magenta"];11311 -> 11355[label="",style="dashed", color="magenta", weight=3];
11312 -> 6431[label="",style="dashed", color="red", weight=0];
11312[label="toEnum (Pos wy253)",fontsize=16,color="magenta"];11312 -> 11356[label="",style="dashed", color="magenta", weight=3];
11313 -> 6432[label="",style="dashed", color="red", weight=0];
11313[label="toEnum (Pos wy253)",fontsize=16,color="magenta"];11313 -> 11357[label="",style="dashed", color="magenta", weight=3];
11314 -> 6433[label="",style="dashed", color="red", weight=0];
11314[label="toEnum (Pos wy253)",fontsize=16,color="magenta"];11314 -> 11358[label="",style="dashed", color="magenta", weight=3];
11315 -> 352[label="",style="dashed", color="red", weight=0];
11315[label="toEnum (Pos wy253)",fontsize=16,color="magenta"];11315 -> 11359[label="",style="dashed", color="magenta", weight=3];
11316 -> 6435[label="",style="dashed", color="red", weight=0];
11316[label="toEnum (Pos wy253)",fontsize=16,color="magenta"];11316 -> 11360[label="",style="dashed", color="magenta", weight=3];
11317 -> 6436[label="",style="dashed", color="red", weight=0];
11317[label="toEnum (Pos wy253)",fontsize=16,color="magenta"];11317 -> 11361[label="",style="dashed", color="magenta", weight=3];
11318[label="map toEnum (takeWhile (flip (<=) (Pos (Succ wy252))) (primPlusInt (Pos (Succ wy254)) (Pos wy255) : iterate (primPlusInt (Pos (Succ wy254))) (primPlusInt (Pos (Succ wy254)) (primPlusInt (Pos (Succ wy254)) (Pos wy255)))))\n  Enum a",fontsize=16,color="black",shape="box"];11318 -> 11362[label="",style="solid", color="black", weight=3];
15541[label="wy276",fontsize=16,color="green",shape="box"];15542[label="wy2770",fontsize=16,color="green",shape="box"];15543[label="wy280",fontsize=16,color="green",shape="box"];15544[label="wy281",fontsize=16,color="green",shape="box"];15545[label="Succ wy276",fontsize=16,color="green",shape="box"];15546[label="Succ wy2820",fontsize=16,color="green",shape="box"];15540[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy339))) (Pos wy340) (iterate (primPlusInt (Pos (Succ wy341))) (primPlusInt (Pos (Succ wy341)) (Pos wy342))) (not (primCmpNat wy343 wy344 == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];18653[label="wy343/Succ wy3430",fontsize=10,color="white",style="solid",shape="box"];15540 -> 18653[label="",style="solid", color="burlywood", weight=9];
18653 -> 15607[label="",style="solid", color="burlywood", weight=3];
18654[label="wy343/Zero",fontsize=10,color="white",style="solid",shape="box"];15540 -> 18654[label="",style="solid", color="burlywood", weight=9];
18654 -> 15608[label="",style="solid", color="burlywood", weight=3];
15547[label="wy276",fontsize=16,color="green",shape="box"];15548[label="wy2770",fontsize=16,color="green",shape="box"];15549[label="wy280",fontsize=16,color="green",shape="box"];15550[label="wy281",fontsize=16,color="green",shape="box"];15551[label="Succ wy276",fontsize=16,color="green",shape="box"];15552[label="Zero",fontsize=16,color="green",shape="box"];15283 -> 15090[label="",style="dashed", color="red", weight=0];
15283[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy323))) (primMinusNat wy3240 wy3250) (iterate (primPlusInt (Neg (Succ wy326))) (primPlusInt (Neg (Succ wy326)) (primMinusNat wy3240 wy3250))) (not (primCmpInt (primMinusNat wy3240 wy3250) (Pos (Succ wy323)) == LT)))\n  Enum a",fontsize=16,color="magenta"];15283 -> 15342[label="",style="dashed", color="magenta", weight=3];
15283 -> 15343[label="",style="dashed", color="magenta", weight=3];
15284[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy323))) (Pos (Succ wy3240)) (iterate (primPlusInt (Neg (Succ wy326))) (primPlusInt (Neg (Succ wy326)) (Pos (Succ wy3240)))) (not (primCmpInt (Pos (Succ wy3240)) (Pos (Succ wy323)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];15284 -> 15344[label="",style="solid", color="black", weight=3];
15285[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy323))) (Neg (Succ wy3250)) (iterate (primPlusInt (Neg (Succ wy326))) (primPlusInt (Neg (Succ wy326)) (Neg (Succ wy3250)))) (not (primCmpInt (Neg (Succ wy3250)) (Pos (Succ wy323)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];15285 -> 15345[label="",style="solid", color="black", weight=3];
15286[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy323))) (Pos Zero) (iterate (primPlusInt (Neg (Succ wy326))) (primPlusInt (Neg (Succ wy326)) (Pos Zero))) (not (primCmpInt (Pos Zero) (Pos (Succ wy323)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];15286 -> 15346[label="",style="solid", color="black", weight=3];
15746[label="wy284",fontsize=16,color="green",shape="box"];15747[label="wy276",fontsize=16,color="green",shape="box"];15748[label="wy283",fontsize=16,color="green",shape="box"];15749[label="Succ wy276",fontsize=16,color="green",shape="box"];15750[label="Succ wy2850",fontsize=16,color="green",shape="box"];15745[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy347))) (Pos wy348) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy349))) (not (primCmpNat wy350 wy351 == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];18656[label="wy350/Succ wy3500",fontsize=10,color="white",style="solid",shape="box"];15745 -> 18656[label="",style="solid", color="burlywood", weight=9];
18656 -> 15801[label="",style="solid", color="burlywood", weight=3];
18657[label="wy350/Zero",fontsize=10,color="white",style="solid",shape="box"];15745 -> 18657[label="",style="solid", color="burlywood", weight=9];
18657 -> 15802[label="",style="solid", color="burlywood", weight=3];
15751[label="wy284",fontsize=16,color="green",shape="box"];15752[label="wy276",fontsize=16,color="green",shape="box"];15753[label="wy283",fontsize=16,color="green",shape="box"];15754[label="Succ wy276",fontsize=16,color="green",shape="box"];15755[label="Zero",fontsize=16,color="green",shape="box"];6799[label="toEnum (Pos wy201)\n  Enum a",fontsize=16,color="blue",shape="box"];18658[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];6799 -> 18658[label="",style="solid", color="blue", weight=9];
18658 -> 6897[label="",style="solid", color="blue", weight=3];
18659[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];6799 -> 18659[label="",style="solid", color="blue", weight=9];
18659 -> 6898[label="",style="solid", color="blue", weight=3];
18660[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];6799 -> 18660[label="",style="solid", color="blue", weight=9];
18660 -> 6899[label="",style="solid", color="blue", weight=3];
18661[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];6799 -> 18661[label="",style="solid", color="blue", weight=9];
18661 -> 6900[label="",style="solid", color="blue", weight=3];
18662[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];6799 -> 18662[label="",style="solid", color="blue", weight=9];
18662 -> 6901[label="",style="solid", color="blue", weight=3];
18663[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];6799 -> 18663[label="",style="solid", color="blue", weight=9];
18663 -> 6902[label="",style="solid", color="blue", weight=3];
18664[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];6799 -> 18664[label="",style="solid", color="blue", weight=9];
18664 -> 6903[label="",style="solid", color="blue", weight=3];
18665[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];6799 -> 18665[label="",style="solid", color="blue", weight=9];
18665 -> 6904[label="",style="solid", color="blue", weight=3];
18666[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];6799 -> 18666[label="",style="solid", color="blue", weight=9];
18666 -> 6905[label="",style="solid", color="blue", weight=3];
6800[label="map toEnum (takeWhile (flip (>=) (Pos Zero)) (iterate (primPlusInt (Pos (Succ wy1920))) (primPlusInt (Pos (Succ wy1920)) (Pos wy202))))\n  Enum a",fontsize=16,color="black",shape="box"];6800 -> 6906[label="",style="solid", color="black", weight=3];
11440[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (Succ wy2670)) (iterate (primPlusInt (Neg (Succ wy269))) (primPlusInt (Neg (Succ wy269)) (Pos (Succ wy2670)))) True)\n  Enum a",fontsize=16,color="black",shape="box"];11440 -> 11489[label="",style="solid", color="black", weight=3];
11441[label="map toEnum (takeWhile0 (flip (>=) (Pos Zero)) (Neg (Succ wy2680)) (iterate (primPlusInt (Neg (Succ wy269))) (primPlusInt (Neg (Succ wy269)) (Neg (Succ wy2680)))) otherwise)\n  Enum a",fontsize=16,color="black",shape="box"];11441 -> 11490[label="",style="solid", color="black", weight=3];
11442[label="map toEnum (Pos Zero : takeWhile (flip (>=) (Pos Zero)) (iterate (primPlusInt (Neg (Succ wy269))) (primPlusInt (Neg (Succ wy269)) (Pos Zero))))\n  Enum a",fontsize=16,color="black",shape="box"];11442 -> 11491[label="",style="solid", color="black", weight=3];
6809[label="toEnum (Pos wy204)\n  Enum a",fontsize=16,color="blue",shape="box"];18667[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];6809 -> 18667[label="",style="solid", color="blue", weight=9];
18667 -> 6917[label="",style="solid", color="blue", weight=3];
18668[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];6809 -> 18668[label="",style="solid", color="blue", weight=9];
18668 -> 6918[label="",style="solid", color="blue", weight=3];
18669[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];6809 -> 18669[label="",style="solid", color="blue", weight=9];
18669 -> 6919[label="",style="solid", color="blue", weight=3];
18670[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];6809 -> 18670[label="",style="solid", color="blue", weight=9];
18670 -> 6920[label="",style="solid", color="blue", weight=3];
18671[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];6809 -> 18671[label="",style="solid", color="blue", weight=9];
18671 -> 6921[label="",style="solid", color="blue", weight=3];
18672[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];6809 -> 18672[label="",style="solid", color="blue", weight=9];
18672 -> 6922[label="",style="solid", color="blue", weight=3];
18673[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];6809 -> 18673[label="",style="solid", color="blue", weight=9];
18673 -> 6923[label="",style="solid", color="blue", weight=3];
18674[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];6809 -> 18674[label="",style="solid", color="blue", weight=9];
18674 -> 6924[label="",style="solid", color="blue", weight=3];
18675[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];6809 -> 18675[label="",style="solid", color="blue", weight=9];
18675 -> 6925[label="",style="solid", color="blue", weight=3];
6810[label="map toEnum (takeWhile (flip (>=) (Pos Zero)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy205))))\n  Enum a",fontsize=16,color="black",shape="box"];6810 -> 6926[label="",style="solid", color="black", weight=3];
11319[label="wy247",fontsize=16,color="green",shape="box"];6428[label="toEnum (Pos wy177)",fontsize=16,color="black",shape="triangle"];6428 -> 6482[label="",style="solid", color="black", weight=3];
11320[label="wy247",fontsize=16,color="green",shape="box"];6429[label="toEnum (Pos wy177)\n  Integral a",fontsize=16,color="black",shape="triangle"];6429 -> 6483[label="",style="solid", color="black", weight=3];
11321[label="wy247",fontsize=16,color="green",shape="box"];6430[label="toEnum (Pos wy177)",fontsize=16,color="black",shape="triangle"];6430 -> 6484[label="",style="solid", color="black", weight=3];
11322[label="wy247",fontsize=16,color="green",shape="box"];6431[label="toEnum (Pos wy177)",fontsize=16,color="black",shape="triangle"];6431 -> 6485[label="",style="solid", color="black", weight=3];
11323[label="wy247",fontsize=16,color="green",shape="box"];6432[label="toEnum (Pos wy177)",fontsize=16,color="black",shape="triangle"];6432 -> 6486[label="",style="solid", color="black", weight=3];
11324[label="wy247",fontsize=16,color="green",shape="box"];6433[label="toEnum (Pos wy177)",fontsize=16,color="black",shape="triangle"];6433 -> 6487[label="",style="solid", color="black", weight=3];
11325[label="Pos wy247",fontsize=16,color="green",shape="box"];11326[label="wy247",fontsize=16,color="green",shape="box"];6435[label="toEnum (Pos wy177)",fontsize=16,color="black",shape="triangle"];6435 -> 6489[label="",style="solid", color="black", weight=3];
11327[label="wy247",fontsize=16,color="green",shape="box"];6436[label="toEnum (Pos wy177)",fontsize=16,color="black",shape="triangle"];6436 -> 6490[label="",style="solid", color="black", weight=3];
11328[label="map toEnum (takeWhile2 (flip (<=) (Pos (Succ wy246))) (primPlusInt (Pos Zero) (Pos wy248) : iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos wy248)))))\n  Enum a",fontsize=16,color="black",shape="box"];11328 -> 11363[label="",style="solid", color="black", weight=3];
14134 -> 13967[label="",style="dashed", color="red", weight=0];
14134[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy306))) (primMinusNat wy3070 wy3080) (iterate (primPlusInt (Neg (Succ wy309))) (primPlusInt (Neg (Succ wy309)) (primMinusNat wy3070 wy3080))) (not (primCmpInt (primMinusNat wy3070 wy3080) (Pos (Succ wy306)) == GT)))\n  Enum a",fontsize=16,color="magenta"];14134 -> 14291[label="",style="dashed", color="magenta", weight=3];
14134 -> 14292[label="",style="dashed", color="magenta", weight=3];
14135[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy306))) (Pos (Succ wy3070)) (iterate (primPlusInt (Neg (Succ wy309))) (primPlusInt (Neg (Succ wy309)) (Pos (Succ wy3070)))) (not (primCmpInt (Pos (Succ wy3070)) (Pos (Succ wy306)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];14135 -> 14293[label="",style="solid", color="black", weight=3];
14136 -> 16010[label="",style="dashed", color="red", weight=0];
14136[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy306))) (Neg (Succ wy3080)) (iterate (primPlusInt (Neg (Succ wy309))) (primPlusInt (Neg (Succ wy309)) (Neg (Succ wy3080)))) (not (primCmpInt (Neg (Succ wy3080)) (Pos (Succ wy306)) == GT)))\n  Enum a",fontsize=16,color="magenta"];14136 -> 16011[label="",style="dashed", color="magenta", weight=3];
14136 -> 16012[label="",style="dashed", color="magenta", weight=3];
14136 -> 16013[label="",style="dashed", color="magenta", weight=3];
14137[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy306))) (Pos Zero) (iterate (primPlusInt (Neg (Succ wy309))) (primPlusInt (Neg (Succ wy309)) (Pos Zero))) (not (primCmpInt (Pos Zero) (Pos (Succ wy306)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];14137 -> 14295[label="",style="solid", color="black", weight=3];
6818[label="toEnum (Pos wy195)\n  Enum a",fontsize=16,color="blue",shape="box"];18678[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];6818 -> 18678[label="",style="solid", color="blue", weight=9];
18678 -> 6935[label="",style="solid", color="blue", weight=3];
18679[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];6818 -> 18679[label="",style="solid", color="blue", weight=9];
18679 -> 6936[label="",style="solid", color="blue", weight=3];
18680[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];6818 -> 18680[label="",style="solid", color="blue", weight=9];
18680 -> 6937[label="",style="solid", color="blue", weight=3];
18681[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];6818 -> 18681[label="",style="solid", color="blue", weight=9];
18681 -> 6938[label="",style="solid", color="blue", weight=3];
18682[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];6818 -> 18682[label="",style="solid", color="blue", weight=9];
18682 -> 6939[label="",style="solid", color="blue", weight=3];
18683[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];6818 -> 18683[label="",style="solid", color="blue", weight=9];
18683 -> 6940[label="",style="solid", color="blue", weight=3];
18684[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];6818 -> 18684[label="",style="solid", color="blue", weight=9];
18684 -> 6941[label="",style="solid", color="blue", weight=3];
18685[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];6818 -> 18685[label="",style="solid", color="blue", weight=9];
18685 -> 6942[label="",style="solid", color="blue", weight=3];
18686[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];6818 -> 18686[label="",style="solid", color="blue", weight=9];
18686 -> 6943[label="",style="solid", color="blue", weight=3];
6819[label="map toEnum (takeWhile (flip (>=) (Neg wy187)) (iterate (primPlusInt (Pos (Succ wy1880))) (primPlusInt (Pos (Succ wy1880)) (Pos wy196))))\n  Enum a",fontsize=16,color="black",shape="box"];6819 -> 6944[label="",style="solid", color="black", weight=3];
11483[label="map toEnum (Pos (Succ wy2720) : takeWhile (flip (>=) (Neg wy271)) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (Pos (Succ wy2720)))))\n  Enum a",fontsize=16,color="black",shape="box"];11483 -> 11542[label="",style="solid", color="black", weight=3];
18114[label="wy2730",fontsize=16,color="green",shape="box"];18115[label="wy2710",fontsize=16,color="green",shape="box"];18116[label="wy274",fontsize=16,color="green",shape="box"];18117[label="Succ wy2730",fontsize=16,color="green",shape="box"];18118[label="wy2710",fontsize=16,color="green",shape="box"];18119[label="Succ wy2730",fontsize=16,color="green",shape="box"];18113[label="map toEnum (takeWhile1 (flip (>=) (Neg (Succ wy443))) (Neg wy444) (iterate (primPlusInt (Neg (Succ wy445))) (primPlusInt (Neg (Succ wy445)) (Neg wy446))) (not (primCmpNat wy447 wy448 == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];18687[label="wy447/Succ wy4470",fontsize=10,color="white",style="solid",shape="box"];18113 -> 18687[label="",style="solid", color="burlywood", weight=9];
18687 -> 18198[label="",style="solid", color="burlywood", weight=3];
18688[label="wy447/Zero",fontsize=10,color="white",style="solid",shape="box"];18113 -> 18688[label="",style="solid", color="burlywood", weight=9];
18688 -> 18199[label="",style="solid", color="burlywood", weight=3];
11486[label="map toEnum (takeWhile1 (flip (>=) (Neg Zero)) (Neg (Succ wy2730)) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (Neg (Succ wy2730)))) (not True))\n  Enum a",fontsize=16,color="black",shape="box"];11486 -> 11547[label="",style="solid", color="black", weight=3];
11487[label="map toEnum (takeWhile1 (flip (>=) (Neg (Succ wy2710))) (Pos Zero) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (Pos Zero))) True)\n  Enum a",fontsize=16,color="black",shape="box"];11487 -> 11548[label="",style="solid", color="black", weight=3];
11488[label="map toEnum (takeWhile1 (flip (>=) (Neg Zero)) (Pos Zero) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (Pos Zero))) True)\n  Enum a",fontsize=16,color="black",shape="box"];11488 -> 11549[label="",style="solid", color="black", weight=3];
6832[label="toEnum (Pos wy198)\n  Enum a",fontsize=16,color="blue",shape="box"];18689[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];6832 -> 18689[label="",style="solid", color="blue", weight=9];
18689 -> 6962[label="",style="solid", color="blue", weight=3];
18690[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];6832 -> 18690[label="",style="solid", color="blue", weight=9];
18690 -> 6963[label="",style="solid", color="blue", weight=3];
18691[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];6832 -> 18691[label="",style="solid", color="blue", weight=9];
18691 -> 6964[label="",style="solid", color="blue", weight=3];
18692[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];6832 -> 18692[label="",style="solid", color="blue", weight=9];
18692 -> 6965[label="",style="solid", color="blue", weight=3];
18693[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];6832 -> 18693[label="",style="solid", color="blue", weight=9];
18693 -> 6966[label="",style="solid", color="blue", weight=3];
18694[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];6832 -> 18694[label="",style="solid", color="blue", weight=9];
18694 -> 6967[label="",style="solid", color="blue", weight=3];
18695[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];6832 -> 18695[label="",style="solid", color="blue", weight=9];
18695 -> 6968[label="",style="solid", color="blue", weight=3];
18696[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];6832 -> 18696[label="",style="solid", color="blue", weight=9];
18696 -> 6969[label="",style="solid", color="blue", weight=3];
18697[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];6832 -> 18697[label="",style="solid", color="blue", weight=9];
18697 -> 6970[label="",style="solid", color="blue", weight=3];
6833[label="map toEnum (takeWhile (flip (>=) (Neg wy187)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy199))))\n  Enum a",fontsize=16,color="black",shape="box"];6833 -> 6971[label="",style="solid", color="black", weight=3];
11353[label="wy253",fontsize=16,color="green",shape="box"];11354[label="wy253",fontsize=16,color="green",shape="box"];11355[label="wy253",fontsize=16,color="green",shape="box"];11356[label="wy253",fontsize=16,color="green",shape="box"];11357[label="wy253",fontsize=16,color="green",shape="box"];11358[label="wy253",fontsize=16,color="green",shape="box"];11359[label="Pos wy253",fontsize=16,color="green",shape="box"];11360[label="wy253",fontsize=16,color="green",shape="box"];11361[label="wy253",fontsize=16,color="green",shape="box"];11362[label="map toEnum (takeWhile2 (flip (<=) (Pos (Succ wy252))) (primPlusInt (Pos (Succ wy254)) (Pos wy255) : iterate (primPlusInt (Pos (Succ wy254))) (primPlusInt (Pos (Succ wy254)) (primPlusInt (Pos (Succ wy254)) (Pos wy255)))))\n  Enum a",fontsize=16,color="black",shape="box"];11362 -> 11390[label="",style="solid", color="black", weight=3];
15607[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy339))) (Pos wy340) (iterate (primPlusInt (Pos (Succ wy341))) (primPlusInt (Pos (Succ wy341)) (Pos wy342))) (not (primCmpNat (Succ wy3430) wy344 == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];18698[label="wy344/Succ wy3440",fontsize=10,color="white",style="solid",shape="box"];15607 -> 18698[label="",style="solid", color="burlywood", weight=9];
18698 -> 15803[label="",style="solid", color="burlywood", weight=3];
18699[label="wy344/Zero",fontsize=10,color="white",style="solid",shape="box"];15607 -> 18699[label="",style="solid", color="burlywood", weight=9];
18699 -> 15804[label="",style="solid", color="burlywood", weight=3];
15608[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy339))) (Pos wy340) (iterate (primPlusInt (Pos (Succ wy341))) (primPlusInt (Pos (Succ wy341)) (Pos wy342))) (not (primCmpNat Zero wy344 == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];18700[label="wy344/Succ wy3440",fontsize=10,color="white",style="solid",shape="box"];15608 -> 18700[label="",style="solid", color="burlywood", weight=9];
18700 -> 15805[label="",style="solid", color="burlywood", weight=3];
18701[label="wy344/Zero",fontsize=10,color="white",style="solid",shape="box"];15608 -> 18701[label="",style="solid", color="burlywood", weight=9];
18701 -> 15806[label="",style="solid", color="burlywood", weight=3];
15342[label="wy3250",fontsize=16,color="green",shape="box"];15343[label="wy3240",fontsize=16,color="green",shape="box"];15344 -> 17683[label="",style="dashed", color="red", weight=0];
15344[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy323))) (Pos (Succ wy3240)) (iterate (primPlusInt (Neg (Succ wy326))) (primPlusInt (Neg (Succ wy326)) (Pos (Succ wy3240)))) (not (primCmpNat (Succ wy3240) (Succ wy323) == LT)))\n  Enum a",fontsize=16,color="magenta"];15344 -> 17684[label="",style="dashed", color="magenta", weight=3];
15344 -> 17685[label="",style="dashed", color="magenta", weight=3];
15344 -> 17686[label="",style="dashed", color="magenta", weight=3];
15344 -> 17687[label="",style="dashed", color="magenta", weight=3];
15344 -> 17688[label="",style="dashed", color="magenta", weight=3];
15345[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy323))) (Neg (Succ wy3250)) (iterate (primPlusInt (Neg (Succ wy326))) (primPlusInt (Neg (Succ wy326)) (Neg (Succ wy3250)))) (not (LT == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];15345 -> 15373[label="",style="solid", color="black", weight=3];
15346[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy323))) (Pos Zero) (iterate (primPlusInt (Neg (Succ wy326))) (primPlusInt (Neg (Succ wy326)) (Pos Zero))) (not (primCmpNat Zero (Succ wy323) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];15346 -> 15374[label="",style="solid", color="black", weight=3];
15801[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy347))) (Pos wy348) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy349))) (not (primCmpNat (Succ wy3500) wy351 == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];18703[label="wy351/Succ wy3510",fontsize=10,color="white",style="solid",shape="box"];15801 -> 18703[label="",style="solid", color="burlywood", weight=9];
18703 -> 15901[label="",style="solid", color="burlywood", weight=3];
18704[label="wy351/Zero",fontsize=10,color="white",style="solid",shape="box"];15801 -> 18704[label="",style="solid", color="burlywood", weight=9];
18704 -> 15902[label="",style="solid", color="burlywood", weight=3];
15802[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy347))) (Pos wy348) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy349))) (not (primCmpNat Zero wy351 == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];18705[label="wy351/Succ wy3510",fontsize=10,color="white",style="solid",shape="box"];15802 -> 18705[label="",style="solid", color="burlywood", weight=9];
18705 -> 15903[label="",style="solid", color="burlywood", weight=3];
18706[label="wy351/Zero",fontsize=10,color="white",style="solid",shape="box"];15802 -> 18706[label="",style="solid", color="burlywood", weight=9];
18706 -> 15904[label="",style="solid", color="burlywood", weight=3];
6897 -> 6428[label="",style="dashed", color="red", weight=0];
6897[label="toEnum (Pos wy201)",fontsize=16,color="magenta"];6897 -> 6995[label="",style="dashed", color="magenta", weight=3];
6898 -> 6429[label="",style="dashed", color="red", weight=0];
6898[label="toEnum (Pos wy201)\n  Integral a",fontsize=16,color="magenta"];6898 -> 6996[label="",style="dashed", color="magenta", weight=3];
6899 -> 6430[label="",style="dashed", color="red", weight=0];
6899[label="toEnum (Pos wy201)",fontsize=16,color="magenta"];6899 -> 6997[label="",style="dashed", color="magenta", weight=3];
6900 -> 6431[label="",style="dashed", color="red", weight=0];
6900[label="toEnum (Pos wy201)",fontsize=16,color="magenta"];6900 -> 6998[label="",style="dashed", color="magenta", weight=3];
6901 -> 6432[label="",style="dashed", color="red", weight=0];
6901[label="toEnum (Pos wy201)",fontsize=16,color="magenta"];6901 -> 6999[label="",style="dashed", color="magenta", weight=3];
6902 -> 6433[label="",style="dashed", color="red", weight=0];
6902[label="toEnum (Pos wy201)",fontsize=16,color="magenta"];6902 -> 7000[label="",style="dashed", color="magenta", weight=3];
6903 -> 352[label="",style="dashed", color="red", weight=0];
6903[label="toEnum (Pos wy201)",fontsize=16,color="magenta"];6903 -> 7001[label="",style="dashed", color="magenta", weight=3];
6904 -> 6435[label="",style="dashed", color="red", weight=0];
6904[label="toEnum (Pos wy201)",fontsize=16,color="magenta"];6904 -> 7002[label="",style="dashed", color="magenta", weight=3];
6905 -> 6436[label="",style="dashed", color="red", weight=0];
6905[label="toEnum (Pos wy201)",fontsize=16,color="magenta"];6905 -> 7003[label="",style="dashed", color="magenta", weight=3];
6906[label="map toEnum (takeWhile (flip (>=) (Pos Zero)) (primPlusInt (Pos (Succ wy1920)) (Pos wy202) : iterate (primPlusInt (Pos (Succ wy1920))) (primPlusInt (Pos (Succ wy1920)) (primPlusInt (Pos (Succ wy1920)) (Pos wy202)))))\n  Enum a",fontsize=16,color="black",shape="box"];6906 -> 7004[label="",style="solid", color="black", weight=3];
11489[label="map toEnum (Pos (Succ wy2670) : takeWhile (flip (>=) (Pos Zero)) (iterate (primPlusInt (Neg (Succ wy269))) (primPlusInt (Neg (Succ wy269)) (Pos (Succ wy2670)))))\n  Enum a",fontsize=16,color="black",shape="box"];11489 -> 11550[label="",style="solid", color="black", weight=3];
11490[label="map toEnum (takeWhile0 (flip (>=) (Pos Zero)) (Neg (Succ wy2680)) (iterate (primPlusInt (Neg (Succ wy269))) (primPlusInt (Neg (Succ wy269)) (Neg (Succ wy2680)))) True)\n  Enum a",fontsize=16,color="black",shape="box"];11490 -> 11551[label="",style="solid", color="black", weight=3];
11491[label="toEnum (Pos Zero) : map toEnum (takeWhile (flip (>=) (Pos Zero)) (iterate (primPlusInt (Neg (Succ wy269))) (primPlusInt (Neg (Succ wy269)) (Pos Zero))))\n  Enum a",fontsize=16,color="green",shape="box"];11491 -> 11552[label="",style="dashed", color="green", weight=3];
11491 -> 11553[label="",style="dashed", color="green", weight=3];
6917 -> 6428[label="",style="dashed", color="red", weight=0];
6917[label="toEnum (Pos wy204)",fontsize=16,color="magenta"];6917 -> 7016[label="",style="dashed", color="magenta", weight=3];
6918 -> 6429[label="",style="dashed", color="red", weight=0];
6918[label="toEnum (Pos wy204)\n  Integral a",fontsize=16,color="magenta"];6918 -> 7017[label="",style="dashed", color="magenta", weight=3];
6919 -> 6430[label="",style="dashed", color="red", weight=0];
6919[label="toEnum (Pos wy204)",fontsize=16,color="magenta"];6919 -> 7018[label="",style="dashed", color="magenta", weight=3];
6920 -> 6431[label="",style="dashed", color="red", weight=0];
6920[label="toEnum (Pos wy204)",fontsize=16,color="magenta"];6920 -> 7019[label="",style="dashed", color="magenta", weight=3];
6921 -> 6432[label="",style="dashed", color="red", weight=0];
6921[label="toEnum (Pos wy204)",fontsize=16,color="magenta"];6921 -> 7020[label="",style="dashed", color="magenta", weight=3];
6922 -> 6433[label="",style="dashed", color="red", weight=0];
6922[label="toEnum (Pos wy204)",fontsize=16,color="magenta"];6922 -> 7021[label="",style="dashed", color="magenta", weight=3];
6923 -> 352[label="",style="dashed", color="red", weight=0];
6923[label="toEnum (Pos wy204)",fontsize=16,color="magenta"];6923 -> 7022[label="",style="dashed", color="magenta", weight=3];
6924 -> 6435[label="",style="dashed", color="red", weight=0];
6924[label="toEnum (Pos wy204)",fontsize=16,color="magenta"];6924 -> 7023[label="",style="dashed", color="magenta", weight=3];
6925 -> 6436[label="",style="dashed", color="red", weight=0];
6925[label="toEnum (Pos wy204)",fontsize=16,color="magenta"];6925 -> 7024[label="",style="dashed", color="magenta", weight=3];
6926[label="map toEnum (takeWhile (flip (>=) (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy205) : iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos wy205)))))\n  Enum a",fontsize=16,color="black",shape="box"];6926 -> 7025[label="",style="solid", color="black", weight=3];
6482[label="error []",fontsize=16,color="red",shape="box"];6483[label="error []",fontsize=16,color="red",shape="box"];6484[label="error []",fontsize=16,color="red",shape="box"];6485[label="error []",fontsize=16,color="red",shape="box"];6486[label="error []",fontsize=16,color="red",shape="box"];6487[label="error []",fontsize=16,color="red",shape="box"];6489[label="error []",fontsize=16,color="red",shape="box"];6490[label="error []",fontsize=16,color="red",shape="box"];11363[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy246))) (primPlusInt (Pos Zero) (Pos wy248)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos wy248)))) (flip (<=) (Pos (Succ wy246)) (primPlusInt (Pos Zero) (Pos wy248))))\n  Enum a",fontsize=16,color="black",shape="box"];11363 -> 11391[label="",style="solid", color="black", weight=3];
14291[label="wy3080",fontsize=16,color="green",shape="box"];14292[label="wy3070",fontsize=16,color="green",shape="box"];14293 -> 17274[label="",style="dashed", color="red", weight=0];
14293[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy306))) (Pos (Succ wy3070)) (iterate (primPlusInt (Neg (Succ wy309))) (primPlusInt (Neg (Succ wy309)) (Pos (Succ wy3070)))) (not (primCmpNat (Succ wy3070) (Succ wy306) == GT)))\n  Enum a",fontsize=16,color="magenta"];14293 -> 17275[label="",style="dashed", color="magenta", weight=3];
14293 -> 17276[label="",style="dashed", color="magenta", weight=3];
14293 -> 17277[label="",style="dashed", color="magenta", weight=3];
14293 -> 17278[label="",style="dashed", color="magenta", weight=3];
14293 -> 17279[label="",style="dashed", color="magenta", weight=3];
16011[label="Succ wy3080",fontsize=16,color="green",shape="box"];16012[label="Succ wy3080",fontsize=16,color="green",shape="box"];16013[label="Succ wy3080",fontsize=16,color="green",shape="box"];16010[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy306))) (Neg wy359) (iterate (primPlusInt (Neg (Succ wy309))) (primPlusInt (Neg (Succ wy309)) (Neg wy360))) (not (primCmpInt (Neg wy361) (Pos (Succ wy306)) == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];18726[label="wy361/Succ wy3610",fontsize=10,color="white",style="solid",shape="box"];16010 -> 18726[label="",style="solid", color="burlywood", weight=9];
18726 -> 16017[label="",style="solid", color="burlywood", weight=3];
18727[label="wy361/Zero",fontsize=10,color="white",style="solid",shape="box"];16010 -> 18727[label="",style="solid", color="burlywood", weight=9];
18727 -> 16018[label="",style="solid", color="burlywood", weight=3];
14295[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy306))) (Pos Zero) (iterate (primPlusInt (Neg (Succ wy309))) (primPlusInt (Neg (Succ wy309)) (Pos Zero))) (not (primCmpNat Zero (Succ wy306) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];14295 -> 14499[label="",style="solid", color="black", weight=3];
6935 -> 6428[label="",style="dashed", color="red", weight=0];
6935[label="toEnum (Pos wy195)",fontsize=16,color="magenta"];6935 -> 7032[label="",style="dashed", color="magenta", weight=3];
6936 -> 6429[label="",style="dashed", color="red", weight=0];
6936[label="toEnum (Pos wy195)\n  Integral a",fontsize=16,color="magenta"];6936 -> 7033[label="",style="dashed", color="magenta", weight=3];
6937 -> 6430[label="",style="dashed", color="red", weight=0];
6937[label="toEnum (Pos wy195)",fontsize=16,color="magenta"];6937 -> 7034[label="",style="dashed", color="magenta", weight=3];
6938 -> 6431[label="",style="dashed", color="red", weight=0];
6938[label="toEnum (Pos wy195)",fontsize=16,color="magenta"];6938 -> 7035[label="",style="dashed", color="magenta", weight=3];
6939 -> 6432[label="",style="dashed", color="red", weight=0];
6939[label="toEnum (Pos wy195)",fontsize=16,color="magenta"];6939 -> 7036[label="",style="dashed", color="magenta", weight=3];
6940 -> 6433[label="",style="dashed", color="red", weight=0];
6940[label="toEnum (Pos wy195)",fontsize=16,color="magenta"];6940 -> 7037[label="",style="dashed", color="magenta", weight=3];
6941 -> 352[label="",style="dashed", color="red", weight=0];
6941[label="toEnum (Pos wy195)",fontsize=16,color="magenta"];6941 -> 7038[label="",style="dashed", color="magenta", weight=3];
6942 -> 6435[label="",style="dashed", color="red", weight=0];
6942[label="toEnum (Pos wy195)",fontsize=16,color="magenta"];6942 -> 7039[label="",style="dashed", color="magenta", weight=3];
6943 -> 6436[label="",style="dashed", color="red", weight=0];
6943[label="toEnum (Pos wy195)",fontsize=16,color="magenta"];6943 -> 7040[label="",style="dashed", color="magenta", weight=3];
6944[label="map toEnum (takeWhile (flip (>=) (Neg wy187)) (primPlusInt (Pos (Succ wy1880)) (Pos wy196) : iterate (primPlusInt (Pos (Succ wy1880))) (primPlusInt (Pos (Succ wy1880)) (primPlusInt (Pos (Succ wy1880)) (Pos wy196)))))\n  Enum a",fontsize=16,color="black",shape="box"];6944 -> 7041[label="",style="solid", color="black", weight=3];
11542[label="toEnum (Pos (Succ wy2720)) : map toEnum (takeWhile (flip (>=) (Neg wy271)) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (Pos (Succ wy2720)))))\n  Enum a",fontsize=16,color="green",shape="box"];11542 -> 11602[label="",style="dashed", color="green", weight=3];
11542 -> 11603[label="",style="dashed", color="green", weight=3];
18198[label="map toEnum (takeWhile1 (flip (>=) (Neg (Succ wy443))) (Neg wy444) (iterate (primPlusInt (Neg (Succ wy445))) (primPlusInt (Neg (Succ wy445)) (Neg wy446))) (not (primCmpNat (Succ wy4470) wy448 == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];18737[label="wy448/Succ wy4480",fontsize=10,color="white",style="solid",shape="box"];18198 -> 18737[label="",style="solid", color="burlywood", weight=9];
18737 -> 18200[label="",style="solid", color="burlywood", weight=3];
18738[label="wy448/Zero",fontsize=10,color="white",style="solid",shape="box"];18198 -> 18738[label="",style="solid", color="burlywood", weight=9];
18738 -> 18201[label="",style="solid", color="burlywood", weight=3];
18199[label="map toEnum (takeWhile1 (flip (>=) (Neg (Succ wy443))) (Neg wy444) (iterate (primPlusInt (Neg (Succ wy445))) (primPlusInt (Neg (Succ wy445)) (Neg wy446))) (not (primCmpNat Zero wy448 == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];18739[label="wy448/Succ wy4480",fontsize=10,color="white",style="solid",shape="box"];18199 -> 18739[label="",style="solid", color="burlywood", weight=9];
18739 -> 18202[label="",style="solid", color="burlywood", weight=3];
18740[label="wy448/Zero",fontsize=10,color="white",style="solid",shape="box"];18199 -> 18740[label="",style="solid", color="burlywood", weight=9];
18740 -> 18203[label="",style="solid", color="burlywood", weight=3];
11547[label="map toEnum (takeWhile1 (flip (>=) (Neg Zero)) (Neg (Succ wy2730)) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (Neg (Succ wy2730)))) False)\n  Enum a",fontsize=16,color="black",shape="box"];11547 -> 11608[label="",style="solid", color="black", weight=3];
11548[label="map toEnum (Pos Zero : takeWhile (flip (>=) (Neg (Succ wy2710))) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (Pos Zero))))\n  Enum a",fontsize=16,color="black",shape="box"];11548 -> 11609[label="",style="solid", color="black", weight=3];
11549[label="map toEnum (Pos Zero : takeWhile (flip (>=) (Neg Zero)) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (Pos Zero))))\n  Enum a",fontsize=16,color="black",shape="box"];11549 -> 11610[label="",style="solid", color="black", weight=3];
6962 -> 6428[label="",style="dashed", color="red", weight=0];
6962[label="toEnum (Pos wy198)",fontsize=16,color="magenta"];6962 -> 7060[label="",style="dashed", color="magenta", weight=3];
6963 -> 6429[label="",style="dashed", color="red", weight=0];
6963[label="toEnum (Pos wy198)\n  Integral a",fontsize=16,color="magenta"];6963 -> 7061[label="",style="dashed", color="magenta", weight=3];
6964 -> 6430[label="",style="dashed", color="red", weight=0];
6964[label="toEnum (Pos wy198)",fontsize=16,color="magenta"];6964 -> 7062[label="",style="dashed", color="magenta", weight=3];
6965 -> 6431[label="",style="dashed", color="red", weight=0];
6965[label="toEnum (Pos wy198)",fontsize=16,color="magenta"];6965 -> 7063[label="",style="dashed", color="magenta", weight=3];
6966 -> 6432[label="",style="dashed", color="red", weight=0];
6966[label="toEnum (Pos wy198)",fontsize=16,color="magenta"];6966 -> 7064[label="",style="dashed", color="magenta", weight=3];
6967 -> 6433[label="",style="dashed", color="red", weight=0];
6967[label="toEnum (Pos wy198)",fontsize=16,color="magenta"];6967 -> 7065[label="",style="dashed", color="magenta", weight=3];
6968 -> 352[label="",style="dashed", color="red", weight=0];
6968[label="toEnum (Pos wy198)",fontsize=16,color="magenta"];6968 -> 7066[label="",style="dashed", color="magenta", weight=3];
6969 -> 6435[label="",style="dashed", color="red", weight=0];
6969[label="toEnum (Pos wy198)",fontsize=16,color="magenta"];6969 -> 7067[label="",style="dashed", color="magenta", weight=3];
6970 -> 6436[label="",style="dashed", color="red", weight=0];
6970[label="toEnum (Pos wy198)",fontsize=16,color="magenta"];6970 -> 7068[label="",style="dashed", color="magenta", weight=3];
6971[label="map toEnum (takeWhile (flip (>=) (Neg wy187)) (primPlusInt (Pos Zero) (Pos wy199) : iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos wy199)))))\n  Enum a",fontsize=16,color="black",shape="box"];6971 -> 7069[label="",style="solid", color="black", weight=3];
11390[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy252))) (primPlusInt (Pos (Succ wy254)) (Pos wy255)) (iterate (primPlusInt (Pos (Succ wy254))) (primPlusInt (Pos (Succ wy254)) (primPlusInt (Pos (Succ wy254)) (Pos wy255)))) (flip (<=) (Pos (Succ wy252)) (primPlusInt (Pos (Succ wy254)) (Pos wy255))))\n  Enum a",fontsize=16,color="black",shape="box"];11390 -> 11443[label="",style="solid", color="black", weight=3];
15803[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy339))) (Pos wy340) (iterate (primPlusInt (Pos (Succ wy341))) (primPlusInt (Pos (Succ wy341)) (Pos wy342))) (not (primCmpNat (Succ wy3430) (Succ wy3440) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];15803 -> 15905[label="",style="solid", color="black", weight=3];
15804[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy339))) (Pos wy340) (iterate (primPlusInt (Pos (Succ wy341))) (primPlusInt (Pos (Succ wy341)) (Pos wy342))) (not (primCmpNat (Succ wy3430) Zero == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];15804 -> 15906[label="",style="solid", color="black", weight=3];
15805[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy339))) (Pos wy340) (iterate (primPlusInt (Pos (Succ wy341))) (primPlusInt (Pos (Succ wy341)) (Pos wy342))) (not (primCmpNat Zero (Succ wy3440) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];15805 -> 15907[label="",style="solid", color="black", weight=3];
15806[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy339))) (Pos wy340) (iterate (primPlusInt (Pos (Succ wy341))) (primPlusInt (Pos (Succ wy341)) (Pos wy342))) (not (primCmpNat Zero Zero == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];15806 -> 15908[label="",style="solid", color="black", weight=3];
17684[label="Succ wy323",fontsize=16,color="green",shape="box"];17685[label="wy323",fontsize=16,color="green",shape="box"];17686[label="wy326",fontsize=16,color="green",shape="box"];17687[label="wy3240",fontsize=16,color="green",shape="box"];17688[label="Succ wy3240",fontsize=16,color="green",shape="box"];17683[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy422))) (Pos (Succ wy423)) (iterate (primPlusInt (Neg (Succ wy424))) (primPlusInt (Neg (Succ wy424)) (Pos (Succ wy423)))) (not (primCmpNat wy425 wy426 == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];18750[label="wy425/Succ wy4250",fontsize=10,color="white",style="solid",shape="box"];17683 -> 18750[label="",style="solid", color="burlywood", weight=9];
18750 -> 17739[label="",style="solid", color="burlywood", weight=3];
18751[label="wy425/Zero",fontsize=10,color="white",style="solid",shape="box"];17683 -> 18751[label="",style="solid", color="burlywood", weight=9];
18751 -> 17740[label="",style="solid", color="burlywood", weight=3];
15373[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy323))) (Neg (Succ wy3250)) (iterate (primPlusInt (Neg (Succ wy326))) (primPlusInt (Neg (Succ wy326)) (Neg (Succ wy3250)))) (not True))\n  Enum a",fontsize=16,color="black",shape="box"];15373 -> 15485[label="",style="solid", color="black", weight=3];
15374[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy323))) (Pos Zero) (iterate (primPlusInt (Neg (Succ wy326))) (primPlusInt (Neg (Succ wy326)) (Pos Zero))) (not (LT == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];15374 -> 15486[label="",style="solid", color="black", weight=3];
15901[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy347))) (Pos wy348) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy349))) (not (primCmpNat (Succ wy3500) (Succ wy3510) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];15901 -> 15961[label="",style="solid", color="black", weight=3];
15902[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy347))) (Pos wy348) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy349))) (not (primCmpNat (Succ wy3500) Zero == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];15902 -> 15962[label="",style="solid", color="black", weight=3];
15903[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy347))) (Pos wy348) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy349))) (not (primCmpNat Zero (Succ wy3510) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];15903 -> 15963[label="",style="solid", color="black", weight=3];
15904[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy347))) (Pos wy348) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy349))) (not (primCmpNat Zero Zero == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];15904 -> 15964[label="",style="solid", color="black", weight=3];
6995[label="wy201",fontsize=16,color="green",shape="box"];6996[label="wy201",fontsize=16,color="green",shape="box"];6997[label="wy201",fontsize=16,color="green",shape="box"];6998[label="wy201",fontsize=16,color="green",shape="box"];6999[label="wy201",fontsize=16,color="green",shape="box"];7000[label="wy201",fontsize=16,color="green",shape="box"];7001[label="Pos wy201",fontsize=16,color="green",shape="box"];7002[label="wy201",fontsize=16,color="green",shape="box"];7003[label="wy201",fontsize=16,color="green",shape="box"];7004[label="map toEnum (takeWhile2 (flip (>=) (Pos Zero)) (primPlusInt (Pos (Succ wy1920)) (Pos wy202) : iterate (primPlusInt (Pos (Succ wy1920))) (primPlusInt (Pos (Succ wy1920)) (primPlusInt (Pos (Succ wy1920)) (Pos wy202)))))\n  Enum a",fontsize=16,color="black",shape="box"];7004 -> 7174[label="",style="solid", color="black", weight=3];
11550[label="toEnum (Pos (Succ wy2670)) : map toEnum (takeWhile (flip (>=) (Pos Zero)) (iterate (primPlusInt (Neg (Succ wy269))) (primPlusInt (Neg (Succ wy269)) (Pos (Succ wy2670)))))\n  Enum a",fontsize=16,color="green",shape="box"];11550 -> 11611[label="",style="dashed", color="green", weight=3];
11550 -> 11612[label="",style="dashed", color="green", weight=3];
11551 -> 1285[label="",style="dashed", color="red", weight=0];
11551[label="map toEnum []\n  Enum a",fontsize=16,color="magenta"];11552[label="toEnum (Pos Zero)\n  Enum a",fontsize=16,color="blue",shape="box"];18753[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];11552 -> 18753[label="",style="solid", color="blue", weight=9];
18753 -> 11613[label="",style="solid", color="blue", weight=3];
18754[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];11552 -> 18754[label="",style="solid", color="blue", weight=9];
18754 -> 11614[label="",style="solid", color="blue", weight=3];
18755[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];11552 -> 18755[label="",style="solid", color="blue", weight=9];
18755 -> 11615[label="",style="solid", color="blue", weight=3];
18756[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];11552 -> 18756[label="",style="solid", color="blue", weight=9];
18756 -> 11616[label="",style="solid", color="blue", weight=3];
18757[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];11552 -> 18757[label="",style="solid", color="blue", weight=9];
18757 -> 11617[label="",style="solid", color="blue", weight=3];
18758[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];11552 -> 18758[label="",style="solid", color="blue", weight=9];
18758 -> 11618[label="",style="solid", color="blue", weight=3];
18759[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];11552 -> 18759[label="",style="solid", color="blue", weight=9];
18759 -> 11619[label="",style="solid", color="blue", weight=3];
18760[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];11552 -> 18760[label="",style="solid", color="blue", weight=9];
18760 -> 11620[label="",style="solid", color="blue", weight=3];
18761[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];11552 -> 18761[label="",style="solid", color="blue", weight=9];
18761 -> 11621[label="",style="solid", color="blue", weight=3];
11553[label="map toEnum (takeWhile (flip (>=) (Pos Zero)) (iterate (primPlusInt (Neg (Succ wy269))) (primPlusInt (Neg (Succ wy269)) (Pos Zero))))\n  Enum a",fontsize=16,color="black",shape="box"];11553 -> 11622[label="",style="solid", color="black", weight=3];
7016[label="wy204",fontsize=16,color="green",shape="box"];7017[label="wy204",fontsize=16,color="green",shape="box"];7018[label="wy204",fontsize=16,color="green",shape="box"];7019[label="wy204",fontsize=16,color="green",shape="box"];7020[label="wy204",fontsize=16,color="green",shape="box"];7021[label="wy204",fontsize=16,color="green",shape="box"];7022[label="Pos wy204",fontsize=16,color="green",shape="box"];7023[label="wy204",fontsize=16,color="green",shape="box"];7024[label="wy204",fontsize=16,color="green",shape="box"];7025[label="map toEnum (takeWhile2 (flip (>=) (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy205) : iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos wy205)))))\n  Enum a",fontsize=16,color="black",shape="box"];7025 -> 7195[label="",style="solid", color="black", weight=3];
11391[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy246))) (primPlusInt (Pos Zero) (Pos wy248)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos wy248)))) ((<=) primPlusInt (Pos Zero) (Pos wy248) Pos (Succ wy246)))\n  Enum a",fontsize=16,color="black",shape="box"];11391 -> 11444[label="",style="solid", color="black", weight=3];
17275[label="wy306",fontsize=16,color="green",shape="box"];17276[label="Succ wy306",fontsize=16,color="green",shape="box"];17277[label="Succ wy3070",fontsize=16,color="green",shape="box"];17278[label="wy309",fontsize=16,color="green",shape="box"];17279[label="wy3070",fontsize=16,color="green",shape="box"];17274[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy401))) (Pos (Succ wy402)) (iterate (primPlusInt (Neg (Succ wy403))) (primPlusInt (Neg (Succ wy403)) (Pos (Succ wy402)))) (not (primCmpNat wy404 wy405 == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];18762[label="wy404/Succ wy4040",fontsize=10,color="white",style="solid",shape="box"];17274 -> 18762[label="",style="solid", color="burlywood", weight=9];
18762 -> 17330[label="",style="solid", color="burlywood", weight=3];
18763[label="wy404/Zero",fontsize=10,color="white",style="solid",shape="box"];17274 -> 18763[label="",style="solid", color="burlywood", weight=9];
18763 -> 17331[label="",style="solid", color="burlywood", weight=3];
16017[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy306))) (Neg wy359) (iterate (primPlusInt (Neg (Succ wy309))) (primPlusInt (Neg (Succ wy309)) (Neg wy360))) (not (primCmpInt (Neg (Succ wy3610)) (Pos (Succ wy306)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];16017 -> 16065[label="",style="solid", color="black", weight=3];
16018[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy306))) (Neg wy359) (iterate (primPlusInt (Neg (Succ wy309))) (primPlusInt (Neg (Succ wy309)) (Neg wy360))) (not (primCmpInt (Neg Zero) (Pos (Succ wy306)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];16018 -> 16066[label="",style="solid", color="black", weight=3];
14499[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy306))) (Pos Zero) (iterate (primPlusInt (Neg (Succ wy309))) (primPlusInt (Neg (Succ wy309)) (Pos Zero))) (not (LT == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];14499 -> 14643[label="",style="solid", color="black", weight=3];
7032[label="wy195",fontsize=16,color="green",shape="box"];7033[label="wy195",fontsize=16,color="green",shape="box"];7034[label="wy195",fontsize=16,color="green",shape="box"];7035[label="wy195",fontsize=16,color="green",shape="box"];7036[label="wy195",fontsize=16,color="green",shape="box"];7037[label="wy195",fontsize=16,color="green",shape="box"];7038[label="Pos wy195",fontsize=16,color="green",shape="box"];7039[label="wy195",fontsize=16,color="green",shape="box"];7040[label="wy195",fontsize=16,color="green",shape="box"];7041[label="map toEnum (takeWhile2 (flip (>=) (Neg wy187)) (primPlusInt (Pos (Succ wy1880)) (Pos wy196) : iterate (primPlusInt (Pos (Succ wy1880))) (primPlusInt (Pos (Succ wy1880)) (primPlusInt (Pos (Succ wy1880)) (Pos wy196)))))\n  Enum a",fontsize=16,color="black",shape="box"];7041 -> 7203[label="",style="solid", color="black", weight=3];
11602[label="toEnum (Pos (Succ wy2720))\n  Enum a",fontsize=16,color="blue",shape="box"];18764[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];11602 -> 18764[label="",style="solid", color="blue", weight=9];
18764 -> 11686[label="",style="solid", color="blue", weight=3];
18765[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];11602 -> 18765[label="",style="solid", color="blue", weight=9];
18765 -> 11687[label="",style="solid", color="blue", weight=3];
18766[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];11602 -> 18766[label="",style="solid", color="blue", weight=9];
18766 -> 11688[label="",style="solid", color="blue", weight=3];
18767[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];11602 -> 18767[label="",style="solid", color="blue", weight=9];
18767 -> 11689[label="",style="solid", color="blue", weight=3];
18768[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];11602 -> 18768[label="",style="solid", color="blue", weight=9];
18768 -> 11690[label="",style="solid", color="blue", weight=3];
18769[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];11602 -> 18769[label="",style="solid", color="blue", weight=9];
18769 -> 11691[label="",style="solid", color="blue", weight=3];
18770[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];11602 -> 18770[label="",style="solid", color="blue", weight=9];
18770 -> 11692[label="",style="solid", color="blue", weight=3];
18771[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];11602 -> 18771[label="",style="solid", color="blue", weight=9];
18771 -> 11693[label="",style="solid", color="blue", weight=3];
18772[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];11602 -> 18772[label="",style="solid", color="blue", weight=9];
18772 -> 11694[label="",style="solid", color="blue", weight=3];
11603[label="map toEnum (takeWhile (flip (>=) (Neg wy271)) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (Pos (Succ wy2720)))))\n  Enum a",fontsize=16,color="black",shape="box"];11603 -> 11695[label="",style="solid", color="black", weight=3];
18200[label="map toEnum (takeWhile1 (flip (>=) (Neg (Succ wy443))) (Neg wy444) (iterate (primPlusInt (Neg (Succ wy445))) (primPlusInt (Neg (Succ wy445)) (Neg wy446))) (not (primCmpNat (Succ wy4470) (Succ wy4480) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];18200 -> 18204[label="",style="solid", color="black", weight=3];
18201[label="map toEnum (takeWhile1 (flip (>=) (Neg (Succ wy443))) (Neg wy444) (iterate (primPlusInt (Neg (Succ wy445))) (primPlusInt (Neg (Succ wy445)) (Neg wy446))) (not (primCmpNat (Succ wy4470) Zero == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];18201 -> 18205[label="",style="solid", color="black", weight=3];
18202[label="map toEnum (takeWhile1 (flip (>=) (Neg (Succ wy443))) (Neg wy444) (iterate (primPlusInt (Neg (Succ wy445))) (primPlusInt (Neg (Succ wy445)) (Neg wy446))) (not (primCmpNat Zero (Succ wy4480) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];18202 -> 18206[label="",style="solid", color="black", weight=3];
18203[label="map toEnum (takeWhile1 (flip (>=) (Neg (Succ wy443))) (Neg wy444) (iterate (primPlusInt (Neg (Succ wy445))) (primPlusInt (Neg (Succ wy445)) (Neg wy446))) (not (primCmpNat Zero Zero == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];18203 -> 18207[label="",style="solid", color="black", weight=3];
11608[label="map toEnum (takeWhile0 (flip (>=) (Neg Zero)) (Neg (Succ wy2730)) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (Neg (Succ wy2730)))) otherwise)\n  Enum a",fontsize=16,color="black",shape="box"];11608 -> 11701[label="",style="solid", color="black", weight=3];
11609[label="toEnum (Pos Zero) : map toEnum (takeWhile (flip (>=) (Neg (Succ wy2710))) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (Pos Zero))))\n  Enum a",fontsize=16,color="green",shape="box"];11609 -> 11702[label="",style="dashed", color="green", weight=3];
11609 -> 11703[label="",style="dashed", color="green", weight=3];
11610[label="toEnum (Pos Zero) : map toEnum (takeWhile (flip (>=) (Neg Zero)) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (Pos Zero))))\n  Enum a",fontsize=16,color="green",shape="box"];11610 -> 11704[label="",style="dashed", color="green", weight=3];
11610 -> 11705[label="",style="dashed", color="green", weight=3];
7060[label="wy198",fontsize=16,color="green",shape="box"];7061[label="wy198",fontsize=16,color="green",shape="box"];7062[label="wy198",fontsize=16,color="green",shape="box"];7063[label="wy198",fontsize=16,color="green",shape="box"];7064[label="wy198",fontsize=16,color="green",shape="box"];7065[label="wy198",fontsize=16,color="green",shape="box"];7066[label="Pos wy198",fontsize=16,color="green",shape="box"];7067[label="wy198",fontsize=16,color="green",shape="box"];7068[label="wy198",fontsize=16,color="green",shape="box"];7069[label="map toEnum (takeWhile2 (flip (>=) (Neg wy187)) (primPlusInt (Pos Zero) (Pos wy199) : iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos wy199)))))\n  Enum a",fontsize=16,color="black",shape="box"];7069 -> 7236[label="",style="solid", color="black", weight=3];
11443[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy252))) (primPlusInt (Pos (Succ wy254)) (Pos wy255)) (iterate (primPlusInt (Pos (Succ wy254))) (primPlusInt (Pos (Succ wy254)) (primPlusInt (Pos (Succ wy254)) (Pos wy255)))) ((<=) primPlusInt (Pos (Succ wy254)) (Pos wy255) Pos (Succ wy252)))\n  Enum a",fontsize=16,color="black",shape="box"];11443 -> 11492[label="",style="solid", color="black", weight=3];
15905 -> 15540[label="",style="dashed", color="red", weight=0];
15905[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy339))) (Pos wy340) (iterate (primPlusInt (Pos (Succ wy341))) (primPlusInt (Pos (Succ wy341)) (Pos wy342))) (not (primCmpNat wy3430 wy3440 == LT)))\n  Enum a",fontsize=16,color="magenta"];15905 -> 15965[label="",style="dashed", color="magenta", weight=3];
15905 -> 15966[label="",style="dashed", color="magenta", weight=3];
15906[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy339))) (Pos wy340) (iterate (primPlusInt (Pos (Succ wy341))) (primPlusInt (Pos (Succ wy341)) (Pos wy342))) (not (GT == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];15906 -> 15967[label="",style="solid", color="black", weight=3];
15907[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy339))) (Pos wy340) (iterate (primPlusInt (Pos (Succ wy341))) (primPlusInt (Pos (Succ wy341)) (Pos wy342))) (not (LT == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];15907 -> 15968[label="",style="solid", color="black", weight=3];
15908[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy339))) (Pos wy340) (iterate (primPlusInt (Pos (Succ wy341))) (primPlusInt (Pos (Succ wy341)) (Pos wy342))) (not (EQ == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];15908 -> 15969[label="",style="solid", color="black", weight=3];
17739[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy422))) (Pos (Succ wy423)) (iterate (primPlusInt (Neg (Succ wy424))) (primPlusInt (Neg (Succ wy424)) (Pos (Succ wy423)))) (not (primCmpNat (Succ wy4250) wy426 == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];18774[label="wy426/Succ wy4260",fontsize=10,color="white",style="solid",shape="box"];17739 -> 18774[label="",style="solid", color="burlywood", weight=9];
18774 -> 17760[label="",style="solid", color="burlywood", weight=3];
18775[label="wy426/Zero",fontsize=10,color="white",style="solid",shape="box"];17739 -> 18775[label="",style="solid", color="burlywood", weight=9];
18775 -> 17761[label="",style="solid", color="burlywood", weight=3];
17740[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy422))) (Pos (Succ wy423)) (iterate (primPlusInt (Neg (Succ wy424))) (primPlusInt (Neg (Succ wy424)) (Pos (Succ wy423)))) (not (primCmpNat Zero wy426 == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];18776[label="wy426/Succ wy4260",fontsize=10,color="white",style="solid",shape="box"];17740 -> 18776[label="",style="solid", color="burlywood", weight=9];
18776 -> 17762[label="",style="solid", color="burlywood", weight=3];
18777[label="wy426/Zero",fontsize=10,color="white",style="solid",shape="box"];17740 -> 18777[label="",style="solid", color="burlywood", weight=9];
18777 -> 17763[label="",style="solid", color="burlywood", weight=3];
15485[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy323))) (Neg (Succ wy3250)) (iterate (primPlusInt (Neg (Succ wy326))) (primPlusInt (Neg (Succ wy326)) (Neg (Succ wy3250)))) False)\n  Enum a",fontsize=16,color="black",shape="box"];15485 -> 15613[label="",style="solid", color="black", weight=3];
15486[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy323))) (Pos Zero) (iterate (primPlusInt (Neg (Succ wy326))) (primPlusInt (Neg (Succ wy326)) (Pos Zero))) (not True))\n  Enum a",fontsize=16,color="black",shape="box"];15486 -> 15614[label="",style="solid", color="black", weight=3];
15961 -> 15745[label="",style="dashed", color="red", weight=0];
15961[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy347))) (Pos wy348) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy349))) (not (primCmpNat wy3500 wy3510 == LT)))\n  Enum a",fontsize=16,color="magenta"];15961 -> 16023[label="",style="dashed", color="magenta", weight=3];
15961 -> 16024[label="",style="dashed", color="magenta", weight=3];
15962[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy347))) (Pos wy348) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy349))) (not (GT == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];15962 -> 16025[label="",style="solid", color="black", weight=3];
15963[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy347))) (Pos wy348) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy349))) (not (LT == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];15963 -> 16026[label="",style="solid", color="black", weight=3];
15964[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy347))) (Pos wy348) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy349))) (not (EQ == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];15964 -> 16027[label="",style="solid", color="black", weight=3];
7174[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Pos (Succ wy1920)) (Pos wy202)) (iterate (primPlusInt (Pos (Succ wy1920))) (primPlusInt (Pos (Succ wy1920)) (primPlusInt (Pos (Succ wy1920)) (Pos wy202)))) (flip (>=) (Pos Zero) (primPlusInt (Pos (Succ wy1920)) (Pos wy202))))\n  Enum a",fontsize=16,color="black",shape="box"];7174 -> 7359[label="",style="solid", color="black", weight=3];
11611[label="toEnum (Pos (Succ wy2670))\n  Enum a",fontsize=16,color="blue",shape="box"];18779[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];11611 -> 18779[label="",style="solid", color="blue", weight=9];
18779 -> 11706[label="",style="solid", color="blue", weight=3];
18780[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];11611 -> 18780[label="",style="solid", color="blue", weight=9];
18780 -> 11707[label="",style="solid", color="blue", weight=3];
18781[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];11611 -> 18781[label="",style="solid", color="blue", weight=9];
18781 -> 11708[label="",style="solid", color="blue", weight=3];
18782[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];11611 -> 18782[label="",style="solid", color="blue", weight=9];
18782 -> 11709[label="",style="solid", color="blue", weight=3];
18783[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];11611 -> 18783[label="",style="solid", color="blue", weight=9];
18783 -> 11710[label="",style="solid", color="blue", weight=3];
18784[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];11611 -> 18784[label="",style="solid", color="blue", weight=9];
18784 -> 11711[label="",style="solid", color="blue", weight=3];
18785[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];11611 -> 18785[label="",style="solid", color="blue", weight=9];
18785 -> 11712[label="",style="solid", color="blue", weight=3];
18786[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];11611 -> 18786[label="",style="solid", color="blue", weight=9];
18786 -> 11713[label="",style="solid", color="blue", weight=3];
18787[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];11611 -> 18787[label="",style="solid", color="blue", weight=9];
18787 -> 11714[label="",style="solid", color="blue", weight=3];
11612[label="map toEnum (takeWhile (flip (>=) (Pos Zero)) (iterate (primPlusInt (Neg (Succ wy269))) (primPlusInt (Neg (Succ wy269)) (Pos (Succ wy2670)))))\n  Enum a",fontsize=16,color="black",shape="box"];11612 -> 11715[label="",style="solid", color="black", weight=3];
11613 -> 6428[label="",style="dashed", color="red", weight=0];
11613[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];11613 -> 11716[label="",style="dashed", color="magenta", weight=3];
11614 -> 6429[label="",style="dashed", color="red", weight=0];
11614[label="toEnum (Pos Zero)\n  Integral a",fontsize=16,color="magenta"];11614 -> 11717[label="",style="dashed", color="magenta", weight=3];
11615 -> 6430[label="",style="dashed", color="red", weight=0];
11615[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];11615 -> 11718[label="",style="dashed", color="magenta", weight=3];
11616 -> 6431[label="",style="dashed", color="red", weight=0];
11616[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];11616 -> 11719[label="",style="dashed", color="magenta", weight=3];
11617 -> 6432[label="",style="dashed", color="red", weight=0];
11617[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];11617 -> 11720[label="",style="dashed", color="magenta", weight=3];
11618 -> 6433[label="",style="dashed", color="red", weight=0];
11618[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];11618 -> 11721[label="",style="dashed", color="magenta", weight=3];
11619 -> 352[label="",style="dashed", color="red", weight=0];
11619[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];11619 -> 11722[label="",style="dashed", color="magenta", weight=3];
11620 -> 6435[label="",style="dashed", color="red", weight=0];
11620[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];11620 -> 11723[label="",style="dashed", color="magenta", weight=3];
11621 -> 6436[label="",style="dashed", color="red", weight=0];
11621[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];11621 -> 11724[label="",style="dashed", color="magenta", weight=3];
11622[label="map toEnum (takeWhile (flip (>=) (Pos Zero)) (primPlusInt (Neg (Succ wy269)) (Pos Zero) : iterate (primPlusInt (Neg (Succ wy269))) (primPlusInt (Neg (Succ wy269)) (primPlusInt (Neg (Succ wy269)) (Pos Zero)))))\n  Enum a",fontsize=16,color="black",shape="box"];11622 -> 11725[label="",style="solid", color="black", weight=3];
7195[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy205)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos wy205)))) (flip (>=) (Pos Zero) (primPlusInt (Pos Zero) (Pos wy205))))\n  Enum a",fontsize=16,color="black",shape="box"];7195 -> 7390[label="",style="solid", color="black", weight=3];
11444[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy246))) (primPlusInt (Pos Zero) (Pos wy248)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos wy248)))) (compare (primPlusInt (Pos Zero) (Pos wy248)) (Pos (Succ wy246)) /= GT))\n  Enum a",fontsize=16,color="black",shape="box"];11444 -> 11493[label="",style="solid", color="black", weight=3];
17330[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy401))) (Pos (Succ wy402)) (iterate (primPlusInt (Neg (Succ wy403))) (primPlusInt (Neg (Succ wy403)) (Pos (Succ wy402)))) (not (primCmpNat (Succ wy4040) wy405 == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];18797[label="wy405/Succ wy4050",fontsize=10,color="white",style="solid",shape="box"];17330 -> 18797[label="",style="solid", color="burlywood", weight=9];
18797 -> 17456[label="",style="solid", color="burlywood", weight=3];
18798[label="wy405/Zero",fontsize=10,color="white",style="solid",shape="box"];17330 -> 18798[label="",style="solid", color="burlywood", weight=9];
18798 -> 17457[label="",style="solid", color="burlywood", weight=3];
17331[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy401))) (Pos (Succ wy402)) (iterate (primPlusInt (Neg (Succ wy403))) (primPlusInt (Neg (Succ wy403)) (Pos (Succ wy402)))) (not (primCmpNat Zero wy405 == GT)))\n  Enum a",fontsize=16,color="burlywood",shape="box"];18799[label="wy405/Succ wy4050",fontsize=10,color="white",style="solid",shape="box"];17331 -> 18799[label="",style="solid", color="burlywood", weight=9];
18799 -> 17458[label="",style="solid", color="burlywood", weight=3];
18800[label="wy405/Zero",fontsize=10,color="white",style="solid",shape="box"];17331 -> 18800[label="",style="solid", color="burlywood", weight=9];
18800 -> 17459[label="",style="solid", color="burlywood", weight=3];
16065[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy306))) (Neg wy359) (iterate (primPlusInt (Neg (Succ wy309))) (primPlusInt (Neg (Succ wy309)) (Neg wy360))) (not (LT == GT)))\n  Enum a",fontsize=16,color="black",shape="triangle"];16065 -> 16137[label="",style="solid", color="black", weight=3];
16066 -> 16065[label="",style="dashed", color="red", weight=0];
16066[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy306))) (Neg wy359) (iterate (primPlusInt (Neg (Succ wy309))) (primPlusInt (Neg (Succ wy309)) (Neg wy360))) (not (LT == GT)))\n  Enum a",fontsize=16,color="magenta"];14643[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy306))) (Pos Zero) (iterate (primPlusInt (Neg (Succ wy309))) (primPlusInt (Neg (Succ wy309)) (Pos Zero))) (not False))\n  Enum a",fontsize=16,color="black",shape="box"];14643 -> 14837[label="",style="solid", color="black", weight=3];
7203[label="map toEnum (takeWhile1 (flip (>=) (Neg wy187)) (primPlusInt (Pos (Succ wy1880)) (Pos wy196)) (iterate (primPlusInt (Pos (Succ wy1880))) (primPlusInt (Pos (Succ wy1880)) (primPlusInt (Pos (Succ wy1880)) (Pos wy196)))) (flip (>=) (Neg wy187) (primPlusInt (Pos (Succ wy1880)) (Pos wy196))))\n  Enum a",fontsize=16,color="black",shape="box"];7203 -> 7401[label="",style="solid", color="black", weight=3];
11686[label="toEnum (Pos (Succ wy2720))",fontsize=16,color="black",shape="box"];11686 -> 17332[label="",style="solid", color="black", weight=3];
11687[label="toEnum (Pos (Succ wy2720))\n  Integral a",fontsize=16,color="black",shape="box"];11687 -> 17333[label="",style="solid", color="black", weight=3];
11688[label="toEnum (Pos (Succ wy2720))",fontsize=16,color="black",shape="box"];11688 -> 17334[label="",style="solid", color="black", weight=3];
11689[label="toEnum (Pos (Succ wy2720))",fontsize=16,color="black",shape="box"];11689 -> 17335[label="",style="solid", color="black", weight=3];
11690[label="toEnum (Pos (Succ wy2720))",fontsize=16,color="black",shape="box"];11690 -> 17336[label="",style="solid", color="black", weight=3];
11691[label="toEnum (Pos (Succ wy2720))",fontsize=16,color="black",shape="box"];11691 -> 17337[label="",style="solid", color="black", weight=3];
11692[label="toEnum (Pos (Succ wy2720))",fontsize=16,color="black",shape="box"];11692 -> 17338[label="",style="solid", color="black", weight=3];
11693[label="toEnum (Pos (Succ wy2720))",fontsize=16,color="black",shape="box"];11693 -> 17339[label="",style="solid", color="black", weight=3];
11694[label="toEnum (Pos (Succ wy2720))",fontsize=16,color="black",shape="box"];11694 -> 17340[label="",style="solid", color="black", weight=3];
11695[label="map toEnum (takeWhile (flip (>=) (Neg wy271)) (primPlusInt (Neg (Succ wy274)) (Pos (Succ wy2720)) : iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (primPlusInt (Neg (Succ wy274)) (Pos (Succ wy2720))))))\n  Enum a",fontsize=16,color="black",shape="box"];11695 -> 11827[label="",style="solid", color="black", weight=3];
18204 -> 18113[label="",style="dashed", color="red", weight=0];
18204[label="map toEnum (takeWhile1 (flip (>=) (Neg (Succ wy443))) (Neg wy444) (iterate (primPlusInt (Neg (Succ wy445))) (primPlusInt (Neg (Succ wy445)) (Neg wy446))) (not (primCmpNat wy4470 wy4480 == LT)))\n  Enum a",fontsize=16,color="magenta"];18204 -> 18208[label="",style="dashed", color="magenta", weight=3];
18204 -> 18209[label="",style="dashed", color="magenta", weight=3];
18205[label="map toEnum (takeWhile1 (flip (>=) (Neg (Succ wy443))) (Neg wy444) (iterate (primPlusInt (Neg (Succ wy445))) (primPlusInt (Neg (Succ wy445)) (Neg wy446))) (not (GT == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];18205 -> 18210[label="",style="solid", color="black", weight=3];
18206[label="map toEnum (takeWhile1 (flip (>=) (Neg (Succ wy443))) (Neg wy444) (iterate (primPlusInt (Neg (Succ wy445))) (primPlusInt (Neg (Succ wy445)) (Neg wy446))) (not (LT == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];18206 -> 18211[label="",style="solid", color="black", weight=3];
18207[label="map toEnum (takeWhile1 (flip (>=) (Neg (Succ wy443))) (Neg wy444) (iterate (primPlusInt (Neg (Succ wy445))) (primPlusInt (Neg (Succ wy445)) (Neg wy446))) (not (EQ == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];18207 -> 18212[label="",style="solid", color="black", weight=3];
11701[label="map toEnum (takeWhile0 (flip (>=) (Neg Zero)) (Neg (Succ wy2730)) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (Neg (Succ wy2730)))) True)\n  Enum a",fontsize=16,color="black",shape="box"];11701 -> 11835[label="",style="solid", color="black", weight=3];
11702[label="toEnum (Pos Zero)\n  Enum a",fontsize=16,color="blue",shape="box"];18803[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];11702 -> 18803[label="",style="solid", color="blue", weight=9];
18803 -> 11836[label="",style="solid", color="blue", weight=3];
18804[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];11702 -> 18804[label="",style="solid", color="blue", weight=9];
18804 -> 11837[label="",style="solid", color="blue", weight=3];
18805[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];11702 -> 18805[label="",style="solid", color="blue", weight=9];
18805 -> 11838[label="",style="solid", color="blue", weight=3];
18806[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];11702 -> 18806[label="",style="solid", color="blue", weight=9];
18806 -> 11839[label="",style="solid", color="blue", weight=3];
18807[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];11702 -> 18807[label="",style="solid", color="blue", weight=9];
18807 -> 11840[label="",style="solid", color="blue", weight=3];
18808[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];11702 -> 18808[label="",style="solid", color="blue", weight=9];
18808 -> 11841[label="",style="solid", color="blue", weight=3];
18809[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];11702 -> 18809[label="",style="solid", color="blue", weight=9];
18809 -> 11842[label="",style="solid", color="blue", weight=3];
18810[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];11702 -> 18810[label="",style="solid", color="blue", weight=9];
18810 -> 11843[label="",style="solid", color="blue", weight=3];
18811[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];11702 -> 18811[label="",style="solid", color="blue", weight=9];
18811 -> 11844[label="",style="solid", color="blue", weight=3];
11703[label="map toEnum (takeWhile (flip (>=) (Neg (Succ wy2710))) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (Pos Zero))))\n  Enum a",fontsize=16,color="black",shape="box"];11703 -> 11845[label="",style="solid", color="black", weight=3];
11704[label="toEnum (Pos Zero)\n  Enum a",fontsize=16,color="blue",shape="box"];18812[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];11704 -> 18812[label="",style="solid", color="blue", weight=9];
18812 -> 11846[label="",style="solid", color="blue", weight=3];
18813[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];11704 -> 18813[label="",style="solid", color="blue", weight=9];
18813 -> 11847[label="",style="solid", color="blue", weight=3];
18814[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];11704 -> 18814[label="",style="solid", color="blue", weight=9];
18814 -> 11848[label="",style="solid", color="blue", weight=3];
18815[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];11704 -> 18815[label="",style="solid", color="blue", weight=9];
18815 -> 11849[label="",style="solid", color="blue", weight=3];
18816[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];11704 -> 18816[label="",style="solid", color="blue", weight=9];
18816 -> 11850[label="",style="solid", color="blue", weight=3];
18817[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];11704 -> 18817[label="",style="solid", color="blue", weight=9];
18817 -> 11851[label="",style="solid", color="blue", weight=3];
18818[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];11704 -> 18818[label="",style="solid", color="blue", weight=9];
18818 -> 11852[label="",style="solid", color="blue", weight=3];
18819[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];11704 -> 18819[label="",style="solid", color="blue", weight=9];
18819 -> 11853[label="",style="solid", color="blue", weight=3];
18820[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];11704 -> 18820[label="",style="solid", color="blue", weight=9];
18820 -> 11854[label="",style="solid", color="blue", weight=3];
11705[label="map toEnum (takeWhile (flip (>=) (Neg Zero)) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (Pos Zero))))\n  Enum a",fontsize=16,color="black",shape="box"];11705 -> 11855[label="",style="solid", color="black", weight=3];
7236[label="map toEnum (takeWhile1 (flip (>=) (Neg wy187)) (primPlusInt (Pos Zero) (Pos wy199)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos wy199)))) (flip (>=) (Neg wy187) (primPlusInt (Pos Zero) (Pos wy199))))\n  Enum a",fontsize=16,color="black",shape="box"];7236 -> 7457[label="",style="solid", color="black", weight=3];
11492[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy252))) (primPlusInt (Pos (Succ wy254)) (Pos wy255)) (iterate (primPlusInt (Pos (Succ wy254))) (primPlusInt (Pos (Succ wy254)) (primPlusInt (Pos (Succ wy254)) (Pos wy255)))) (compare (primPlusInt (Pos (Succ wy254)) (Pos wy255)) (Pos (Succ wy252)) /= GT))\n  Enum a",fontsize=16,color="black",shape="box"];11492 -> 11554[label="",style="solid", color="black", weight=3];
15965[label="wy3440",fontsize=16,color="green",shape="box"];15966[label="wy3430",fontsize=16,color="green",shape="box"];15967[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy339))) (Pos wy340) (iterate (primPlusInt (Pos (Succ wy341))) (primPlusInt (Pos (Succ wy341)) (Pos wy342))) (not False))\n  Enum a",fontsize=16,color="black",shape="triangle"];15967 -> 16028[label="",style="solid", color="black", weight=3];
15968[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy339))) (Pos wy340) (iterate (primPlusInt (Pos (Succ wy341))) (primPlusInt (Pos (Succ wy341)) (Pos wy342))) (not True))\n  Enum a",fontsize=16,color="black",shape="box"];15968 -> 16029[label="",style="solid", color="black", weight=3];
15969 -> 15967[label="",style="dashed", color="red", weight=0];
15969[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy339))) (Pos wy340) (iterate (primPlusInt (Pos (Succ wy341))) (primPlusInt (Pos (Succ wy341)) (Pos wy342))) (not False))\n  Enum a",fontsize=16,color="magenta"];17760[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy422))) (Pos (Succ wy423)) (iterate (primPlusInt (Neg (Succ wy424))) (primPlusInt (Neg (Succ wy424)) (Pos (Succ wy423)))) (not (primCmpNat (Succ wy4250) (Succ wy4260) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];17760 -> 17783[label="",style="solid", color="black", weight=3];
17761[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy422))) (Pos (Succ wy423)) (iterate (primPlusInt (Neg (Succ wy424))) (primPlusInt (Neg (Succ wy424)) (Pos (Succ wy423)))) (not (primCmpNat (Succ wy4250) Zero == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];17761 -> 17784[label="",style="solid", color="black", weight=3];
17762[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy422))) (Pos (Succ wy423)) (iterate (primPlusInt (Neg (Succ wy424))) (primPlusInt (Neg (Succ wy424)) (Pos (Succ wy423)))) (not (primCmpNat Zero (Succ wy4260) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];17762 -> 17785[label="",style="solid", color="black", weight=3];
17763[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy422))) (Pos (Succ wy423)) (iterate (primPlusInt (Neg (Succ wy424))) (primPlusInt (Neg (Succ wy424)) (Pos (Succ wy423)))) (not (primCmpNat Zero Zero == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];17763 -> 17786[label="",style="solid", color="black", weight=3];
15613[label="map toEnum (takeWhile0 (flip (>=) (Pos (Succ wy323))) (Neg (Succ wy3250)) (iterate (primPlusInt (Neg (Succ wy326))) (primPlusInt (Neg (Succ wy326)) (Neg (Succ wy3250)))) otherwise)\n  Enum a",fontsize=16,color="black",shape="box"];15613 -> 15811[label="",style="solid", color="black", weight=3];
15614[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy323))) (Pos Zero) (iterate (primPlusInt (Neg (Succ wy326))) (primPlusInt (Neg (Succ wy326)) (Pos Zero))) False)\n  Enum a",fontsize=16,color="black",shape="box"];15614 -> 15812[label="",style="solid", color="black", weight=3];
16023[label="wy3510",fontsize=16,color="green",shape="box"];16024[label="wy3500",fontsize=16,color="green",shape="box"];16025[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy347))) (Pos wy348) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy349))) (not False))\n  Enum a",fontsize=16,color="black",shape="triangle"];16025 -> 16072[label="",style="solid", color="black", weight=3];
16026[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy347))) (Pos wy348) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy349))) (not True))\n  Enum a",fontsize=16,color="black",shape="box"];16026 -> 16073[label="",style="solid", color="black", weight=3];
16027 -> 16025[label="",style="dashed", color="red", weight=0];
16027[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy347))) (Pos wy348) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy349))) (not False))\n  Enum a",fontsize=16,color="magenta"];7359[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Pos (Succ wy1920)) (Pos wy202)) (iterate (primPlusInt (Pos (Succ wy1920))) (primPlusInt (Pos (Succ wy1920)) (primPlusInt (Pos (Succ wy1920)) (Pos wy202)))) ((>=) primPlusInt (Pos (Succ wy1920)) (Pos wy202) Pos Zero))\n  Enum a",fontsize=16,color="black",shape="box"];7359 -> 7583[label="",style="solid", color="black", weight=3];
11706[label="toEnum (Pos (Succ wy2670))",fontsize=16,color="black",shape="box"];11706 -> 17341[label="",style="solid", color="black", weight=3];
11707[label="toEnum (Pos (Succ wy2670))\n  Integral a",fontsize=16,color="black",shape="box"];11707 -> 17342[label="",style="solid", color="black", weight=3];
11708[label="toEnum (Pos (Succ wy2670))",fontsize=16,color="black",shape="box"];11708 -> 17343[label="",style="solid", color="black", weight=3];
11709[label="toEnum (Pos (Succ wy2670))",fontsize=16,color="black",shape="box"];11709 -> 17344[label="",style="solid", color="black", weight=3];
11710[label="toEnum (Pos (Succ wy2670))",fontsize=16,color="black",shape="box"];11710 -> 17345[label="",style="solid", color="black", weight=3];
11711[label="toEnum (Pos (Succ wy2670))",fontsize=16,color="black",shape="box"];11711 -> 17346[label="",style="solid", color="black", weight=3];
11712[label="toEnum (Pos (Succ wy2670))",fontsize=16,color="black",shape="box"];11712 -> 17347[label="",style="solid", color="black", weight=3];
11713[label="toEnum (Pos (Succ wy2670))",fontsize=16,color="black",shape="box"];11713 -> 17348[label="",style="solid", color="black", weight=3];
11714[label="toEnum (Pos (Succ wy2670))",fontsize=16,color="black",shape="box"];11714 -> 17349[label="",style="solid", color="black", weight=3];
11715[label="map toEnum (takeWhile (flip (>=) (Pos Zero)) (primPlusInt (Neg (Succ wy269)) (Pos (Succ wy2670)) : iterate (primPlusInt (Neg (Succ wy269))) (primPlusInt (Neg (Succ wy269)) (primPlusInt (Neg (Succ wy269)) (Pos (Succ wy2670))))))\n  Enum a",fontsize=16,color="black",shape="box"];11715 -> 11865[label="",style="solid", color="black", weight=3];
11716[label="Zero",fontsize=16,color="green",shape="box"];11717[label="Zero",fontsize=16,color="green",shape="box"];11718[label="Zero",fontsize=16,color="green",shape="box"];11719[label="Zero",fontsize=16,color="green",shape="box"];11720[label="Zero",fontsize=16,color="green",shape="box"];11721[label="Zero",fontsize=16,color="green",shape="box"];11722[label="Pos Zero",fontsize=16,color="green",shape="box"];11723[label="Zero",fontsize=16,color="green",shape="box"];11724[label="Zero",fontsize=16,color="green",shape="box"];11725[label="map toEnum (takeWhile2 (flip (>=) (Pos Zero)) (primPlusInt (Neg (Succ wy269)) (Pos Zero) : iterate (primPlusInt (Neg (Succ wy269))) (primPlusInt (Neg (Succ wy269)) (primPlusInt (Neg (Succ wy269)) (Pos Zero)))))\n  Enum a",fontsize=16,color="black",shape="box"];11725 -> 11866[label="",style="solid", color="black", weight=3];
7390[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy205)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos wy205)))) ((>=) primPlusInt (Pos Zero) (Pos wy205) Pos Zero))\n  Enum a",fontsize=16,color="black",shape="box"];7390 -> 7606[label="",style="solid", color="black", weight=3];
11493[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy246))) (primPlusInt (Pos Zero) (Pos wy248)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos wy248)))) (not (compare (primPlusInt (Pos Zero) (Pos wy248)) (Pos (Succ wy246)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];11493 -> 11555[label="",style="solid", color="black", weight=3];
17456[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy401))) (Pos (Succ wy402)) (iterate (primPlusInt (Neg (Succ wy403))) (primPlusInt (Neg (Succ wy403)) (Pos (Succ wy402)))) (not (primCmpNat (Succ wy4040) (Succ wy4050) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];17456 -> 17504[label="",style="solid", color="black", weight=3];
17457[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy401))) (Pos (Succ wy402)) (iterate (primPlusInt (Neg (Succ wy403))) (primPlusInt (Neg (Succ wy403)) (Pos (Succ wy402)))) (not (primCmpNat (Succ wy4040) Zero == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];17457 -> 17505[label="",style="solid", color="black", weight=3];
17458[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy401))) (Pos (Succ wy402)) (iterate (primPlusInt (Neg (Succ wy403))) (primPlusInt (Neg (Succ wy403)) (Pos (Succ wy402)))) (not (primCmpNat Zero (Succ wy4050) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];17458 -> 17506[label="",style="solid", color="black", weight=3];
17459[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy401))) (Pos (Succ wy402)) (iterate (primPlusInt (Neg (Succ wy403))) (primPlusInt (Neg (Succ wy403)) (Pos (Succ wy402)))) (not (primCmpNat Zero Zero == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];17459 -> 17507[label="",style="solid", color="black", weight=3];
16137[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy306))) (Neg wy359) (iterate (primPlusInt (Neg (Succ wy309))) (primPlusInt (Neg (Succ wy309)) (Neg wy360))) (not False))\n  Enum a",fontsize=16,color="black",shape="box"];16137 -> 16211[label="",style="solid", color="black", weight=3];
14837[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy306))) (Pos Zero) (iterate (primPlusInt (Neg (Succ wy309))) (primPlusInt (Neg (Succ wy309)) (Pos Zero))) True)\n  Enum a",fontsize=16,color="black",shape="box"];14837 -> 15058[label="",style="solid", color="black", weight=3];
7401[label="map toEnum (takeWhile1 (flip (>=) (Neg wy187)) (primPlusInt (Pos (Succ wy1880)) (Pos wy196)) (iterate (primPlusInt (Pos (Succ wy1880))) (primPlusInt (Pos (Succ wy1880)) (primPlusInt (Pos (Succ wy1880)) (Pos wy196)))) ((>=) primPlusInt (Pos (Succ wy1880)) (Pos wy196) Neg wy187))\n  Enum a",fontsize=16,color="black",shape="box"];7401 -> 7618[label="",style="solid", color="black", weight=3];
17332[label="error []",fontsize=16,color="red",shape="box"];17333[label="error []",fontsize=16,color="red",shape="box"];17334[label="error []",fontsize=16,color="red",shape="box"];17335[label="error []",fontsize=16,color="red",shape="box"];17336[label="error []",fontsize=16,color="red",shape="box"];17337[label="error []",fontsize=16,color="red",shape="box"];17338 -> 393[label="",style="dashed", color="red", weight=0];
17338[label="primIntToChar (Pos (Succ wy2720))",fontsize=16,color="magenta"];17338 -> 17460[label="",style="dashed", color="magenta", weight=3];
17339[label="error []",fontsize=16,color="red",shape="box"];17340[label="error []",fontsize=16,color="red",shape="box"];11827[label="map toEnum (takeWhile2 (flip (>=) (Neg wy271)) (primPlusInt (Neg (Succ wy274)) (Pos (Succ wy2720)) : iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (primPlusInt (Neg (Succ wy274)) (Pos (Succ wy2720))))))\n  Enum a",fontsize=16,color="black",shape="box"];11827 -> 11966[label="",style="solid", color="black", weight=3];
18208[label="wy4480",fontsize=16,color="green",shape="box"];18209[label="wy4470",fontsize=16,color="green",shape="box"];18210[label="map toEnum (takeWhile1 (flip (>=) (Neg (Succ wy443))) (Neg wy444) (iterate (primPlusInt (Neg (Succ wy445))) (primPlusInt (Neg (Succ wy445)) (Neg wy446))) (not False))\n  Enum a",fontsize=16,color="black",shape="triangle"];18210 -> 18213[label="",style="solid", color="black", weight=3];
18211[label="map toEnum (takeWhile1 (flip (>=) (Neg (Succ wy443))) (Neg wy444) (iterate (primPlusInt (Neg (Succ wy445))) (primPlusInt (Neg (Succ wy445)) (Neg wy446))) (not True))\n  Enum a",fontsize=16,color="black",shape="box"];18211 -> 18214[label="",style="solid", color="black", weight=3];
18212 -> 18210[label="",style="dashed", color="red", weight=0];
18212[label="map toEnum (takeWhile1 (flip (>=) (Neg (Succ wy443))) (Neg wy444) (iterate (primPlusInt (Neg (Succ wy445))) (primPlusInt (Neg (Succ wy445)) (Neg wy446))) (not False))\n  Enum a",fontsize=16,color="magenta"];11835 -> 1285[label="",style="dashed", color="red", weight=0];
11835[label="map toEnum []\n  Enum a",fontsize=16,color="magenta"];11836 -> 6428[label="",style="dashed", color="red", weight=0];
11836[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];11836 -> 11974[label="",style="dashed", color="magenta", weight=3];
11837 -> 6429[label="",style="dashed", color="red", weight=0];
11837[label="toEnum (Pos Zero)\n  Integral a",fontsize=16,color="magenta"];11837 -> 11975[label="",style="dashed", color="magenta", weight=3];
11838 -> 6430[label="",style="dashed", color="red", weight=0];
11838[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];11838 -> 11976[label="",style="dashed", color="magenta", weight=3];
11839 -> 6431[label="",style="dashed", color="red", weight=0];
11839[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];11839 -> 11977[label="",style="dashed", color="magenta", weight=3];
11840 -> 6432[label="",style="dashed", color="red", weight=0];
11840[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];11840 -> 11978[label="",style="dashed", color="magenta", weight=3];
11841 -> 6433[label="",style="dashed", color="red", weight=0];
11841[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];11841 -> 11979[label="",style="dashed", color="magenta", weight=3];
11842 -> 352[label="",style="dashed", color="red", weight=0];
11842[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];11842 -> 11980[label="",style="dashed", color="magenta", weight=3];
11843 -> 6435[label="",style="dashed", color="red", weight=0];
11843[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];11843 -> 11981[label="",style="dashed", color="magenta", weight=3];
11844 -> 6436[label="",style="dashed", color="red", weight=0];
11844[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];11844 -> 11982[label="",style="dashed", color="magenta", weight=3];
11845[label="map toEnum (takeWhile (flip (>=) (Neg (Succ wy2710))) (primPlusInt (Neg (Succ wy274)) (Pos Zero) : iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (primPlusInt (Neg (Succ wy274)) (Pos Zero)))))\n  Enum a",fontsize=16,color="black",shape="box"];11845 -> 11983[label="",style="solid", color="black", weight=3];
11846 -> 6428[label="",style="dashed", color="red", weight=0];
11846[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];11846 -> 11984[label="",style="dashed", color="magenta", weight=3];
11847 -> 6429[label="",style="dashed", color="red", weight=0];
11847[label="toEnum (Pos Zero)\n  Integral a",fontsize=16,color="magenta"];11847 -> 11985[label="",style="dashed", color="magenta", weight=3];
11848 -> 6430[label="",style="dashed", color="red", weight=0];
11848[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];11848 -> 11986[label="",style="dashed", color="magenta", weight=3];
11849 -> 6431[label="",style="dashed", color="red", weight=0];
11849[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];11849 -> 11987[label="",style="dashed", color="magenta", weight=3];
11850 -> 6432[label="",style="dashed", color="red", weight=0];
11850[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];11850 -> 11988[label="",style="dashed", color="magenta", weight=3];
11851 -> 6433[label="",style="dashed", color="red", weight=0];
11851[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];11851 -> 11989[label="",style="dashed", color="magenta", weight=3];
11852 -> 352[label="",style="dashed", color="red", weight=0];
11852[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];11852 -> 11990[label="",style="dashed", color="magenta", weight=3];
11853 -> 6435[label="",style="dashed", color="red", weight=0];
11853[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];11853 -> 11991[label="",style="dashed", color="magenta", weight=3];
11854 -> 6436[label="",style="dashed", color="red", weight=0];
11854[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];11854 -> 11992[label="",style="dashed", color="magenta", weight=3];
11855[label="map toEnum (takeWhile (flip (>=) (Neg Zero)) (primPlusInt (Neg (Succ wy274)) (Pos Zero) : iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (primPlusInt (Neg (Succ wy274)) (Pos Zero)))))\n  Enum a",fontsize=16,color="black",shape="box"];11855 -> 11993[label="",style="solid", color="black", weight=3];
7457[label="map toEnum (takeWhile1 (flip (>=) (Neg wy187)) (primPlusInt (Pos Zero) (Pos wy199)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos wy199)))) ((>=) primPlusInt (Pos Zero) (Pos wy199) Neg wy187))\n  Enum a",fontsize=16,color="black",shape="box"];7457 -> 7667[label="",style="solid", color="black", weight=3];
11554[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy252))) (primPlusInt (Pos (Succ wy254)) (Pos wy255)) (iterate (primPlusInt (Pos (Succ wy254))) (primPlusInt (Pos (Succ wy254)) (primPlusInt (Pos (Succ wy254)) (Pos wy255)))) (not (compare (primPlusInt (Pos (Succ wy254)) (Pos wy255)) (Pos (Succ wy252)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];11554 -> 11623[label="",style="solid", color="black", weight=3];
16028[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy339))) (Pos wy340) (iterate (primPlusInt (Pos (Succ wy341))) (primPlusInt (Pos (Succ wy341)) (Pos wy342))) True)\n  Enum a",fontsize=16,color="black",shape="box"];16028 -> 16074[label="",style="solid", color="black", weight=3];
16029[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy339))) (Pos wy340) (iterate (primPlusInt (Pos (Succ wy341))) (primPlusInt (Pos (Succ wy341)) (Pos wy342))) False)\n  Enum a",fontsize=16,color="black",shape="box"];16029 -> 16075[label="",style="solid", color="black", weight=3];
17783 -> 17683[label="",style="dashed", color="red", weight=0];
17783[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy422))) (Pos (Succ wy423)) (iterate (primPlusInt (Neg (Succ wy424))) (primPlusInt (Neg (Succ wy424)) (Pos (Succ wy423)))) (not (primCmpNat wy4250 wy4260 == LT)))\n  Enum a",fontsize=16,color="magenta"];17783 -> 17805[label="",style="dashed", color="magenta", weight=3];
17783 -> 17806[label="",style="dashed", color="magenta", weight=3];
17784[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy422))) (Pos (Succ wy423)) (iterate (primPlusInt (Neg (Succ wy424))) (primPlusInt (Neg (Succ wy424)) (Pos (Succ wy423)))) (not (GT == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];17784 -> 17807[label="",style="solid", color="black", weight=3];
17785[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy422))) (Pos (Succ wy423)) (iterate (primPlusInt (Neg (Succ wy424))) (primPlusInt (Neg (Succ wy424)) (Pos (Succ wy423)))) (not (LT == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];17785 -> 17808[label="",style="solid", color="black", weight=3];
17786[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy422))) (Pos (Succ wy423)) (iterate (primPlusInt (Neg (Succ wy424))) (primPlusInt (Neg (Succ wy424)) (Pos (Succ wy423)))) (not (EQ == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];17786 -> 17809[label="",style="solid", color="black", weight=3];
15811[label="map toEnum (takeWhile0 (flip (>=) (Pos (Succ wy323))) (Neg (Succ wy3250)) (iterate (primPlusInt (Neg (Succ wy326))) (primPlusInt (Neg (Succ wy326)) (Neg (Succ wy3250)))) True)\n  Enum a",fontsize=16,color="black",shape="box"];15811 -> 15914[label="",style="solid", color="black", weight=3];
15812[label="map toEnum (takeWhile0 (flip (>=) (Pos (Succ wy323))) (Pos Zero) (iterate (primPlusInt (Neg (Succ wy326))) (primPlusInt (Neg (Succ wy326)) (Pos Zero))) otherwise)\n  Enum a",fontsize=16,color="black",shape="box"];15812 -> 15915[label="",style="solid", color="black", weight=3];
16072[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy347))) (Pos wy348) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy349))) True)\n  Enum a",fontsize=16,color="black",shape="box"];16072 -> 16140[label="",style="solid", color="black", weight=3];
16073[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy347))) (Pos wy348) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy349))) False)\n  Enum a",fontsize=16,color="black",shape="box"];16073 -> 16141[label="",style="solid", color="black", weight=3];
7583[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Pos (Succ wy1920)) (Pos wy202)) (iterate (primPlusInt (Pos (Succ wy1920))) (primPlusInt (Pos (Succ wy1920)) (primPlusInt (Pos (Succ wy1920)) (Pos wy202)))) (compare (primPlusInt (Pos (Succ wy1920)) (Pos wy202)) (Pos Zero) /= LT))\n  Enum a",fontsize=16,color="black",shape="box"];7583 -> 7668[label="",style="solid", color="black", weight=3];
17341[label="error []",fontsize=16,color="red",shape="box"];17342[label="error []",fontsize=16,color="red",shape="box"];17343[label="error []",fontsize=16,color="red",shape="box"];17344[label="error []",fontsize=16,color="red",shape="box"];17345[label="error []",fontsize=16,color="red",shape="box"];17346[label="error []",fontsize=16,color="red",shape="box"];17347 -> 393[label="",style="dashed", color="red", weight=0];
17347[label="primIntToChar (Pos (Succ wy2670))",fontsize=16,color="magenta"];17347 -> 17461[label="",style="dashed", color="magenta", weight=3];
17348[label="error []",fontsize=16,color="red",shape="box"];17349[label="error []",fontsize=16,color="red",shape="box"];11865[label="map toEnum (takeWhile2 (flip (>=) (Pos Zero)) (primPlusInt (Neg (Succ wy269)) (Pos (Succ wy2670)) : iterate (primPlusInt (Neg (Succ wy269))) (primPlusInt (Neg (Succ wy269)) (primPlusInt (Neg (Succ wy269)) (Pos (Succ wy2670))))))\n  Enum a",fontsize=16,color="black",shape="box"];11865 -> 11994[label="",style="solid", color="black", weight=3];
11866[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Neg (Succ wy269)) (Pos Zero)) (iterate (primPlusInt (Neg (Succ wy269))) (primPlusInt (Neg (Succ wy269)) (primPlusInt (Neg (Succ wy269)) (Pos Zero)))) (flip (>=) (Pos Zero) (primPlusInt (Neg (Succ wy269)) (Pos Zero))))\n  Enum a",fontsize=16,color="black",shape="box"];11866 -> 11995[label="",style="solid", color="black", weight=3];
7606[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy205)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos wy205)))) (compare (primPlusInt (Pos Zero) (Pos wy205)) (Pos Zero) /= LT))\n  Enum a",fontsize=16,color="black",shape="box"];7606 -> 7691[label="",style="solid", color="black", weight=3];
11555[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy246))) (primPlusInt (Pos Zero) (Pos wy248)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos wy248)))) (not (primCmpInt (primPlusInt (Pos Zero) (Pos wy248)) (Pos (Succ wy246)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];11555 -> 11624[label="",style="solid", color="black", weight=3];
17504 -> 17274[label="",style="dashed", color="red", weight=0];
17504[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy401))) (Pos (Succ wy402)) (iterate (primPlusInt (Neg (Succ wy403))) (primPlusInt (Neg (Succ wy403)) (Pos (Succ wy402)))) (not (primCmpNat wy4040 wy4050 == GT)))\n  Enum a",fontsize=16,color="magenta"];17504 -> 17543[label="",style="dashed", color="magenta", weight=3];
17504 -> 17544[label="",style="dashed", color="magenta", weight=3];
17505[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy401))) (Pos (Succ wy402)) (iterate (primPlusInt (Neg (Succ wy403))) (primPlusInt (Neg (Succ wy403)) (Pos (Succ wy402)))) (not (GT == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];17505 -> 17545[label="",style="solid", color="black", weight=3];
17506[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy401))) (Pos (Succ wy402)) (iterate (primPlusInt (Neg (Succ wy403))) (primPlusInt (Neg (Succ wy403)) (Pos (Succ wy402)))) (not (LT == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];17506 -> 17546[label="",style="solid", color="black", weight=3];
17507[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy401))) (Pos (Succ wy402)) (iterate (primPlusInt (Neg (Succ wy403))) (primPlusInt (Neg (Succ wy403)) (Pos (Succ wy402)))) (not (EQ == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];17507 -> 17547[label="",style="solid", color="black", weight=3];
16211[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy306))) (Neg wy359) (iterate (primPlusInt (Neg (Succ wy309))) (primPlusInt (Neg (Succ wy309)) (Neg wy360))) True)\n  Enum a",fontsize=16,color="black",shape="box"];16211 -> 16267[label="",style="solid", color="black", weight=3];
15058[label="map toEnum (Pos Zero : takeWhile (flip (<=) (Pos (Succ wy306))) (iterate (primPlusInt (Neg (Succ wy309))) (primPlusInt (Neg (Succ wy309)) (Pos Zero))))\n  Enum a",fontsize=16,color="black",shape="box"];15058 -> 15140[label="",style="solid", color="black", weight=3];
7618[label="map toEnum (takeWhile1 (flip (>=) (Neg wy187)) (primPlusInt (Pos (Succ wy1880)) (Pos wy196)) (iterate (primPlusInt (Pos (Succ wy1880))) (primPlusInt (Pos (Succ wy1880)) (primPlusInt (Pos (Succ wy1880)) (Pos wy196)))) (compare (primPlusInt (Pos (Succ wy1880)) (Pos wy196)) (Neg wy187) /= LT))\n  Enum a",fontsize=16,color="black",shape="box"];7618 -> 7698[label="",style="solid", color="black", weight=3];
17460[label="Pos (Succ wy2720)",fontsize=16,color="green",shape="box"];11966[label="map toEnum (takeWhile1 (flip (>=) (Neg wy271)) (primPlusInt (Neg (Succ wy274)) (Pos (Succ wy2720))) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (primPlusInt (Neg (Succ wy274)) (Pos (Succ wy2720))))) (flip (>=) (Neg wy271) (primPlusInt (Neg (Succ wy274)) (Pos (Succ wy2720)))))\n  Enum a",fontsize=16,color="black",shape="box"];11966 -> 12040[label="",style="solid", color="black", weight=3];
18213[label="map toEnum (takeWhile1 (flip (>=) (Neg (Succ wy443))) (Neg wy444) (iterate (primPlusInt (Neg (Succ wy445))) (primPlusInt (Neg (Succ wy445)) (Neg wy446))) True)\n  Enum a",fontsize=16,color="black",shape="box"];18213 -> 18215[label="",style="solid", color="black", weight=3];
18214[label="map toEnum (takeWhile1 (flip (>=) (Neg (Succ wy443))) (Neg wy444) (iterate (primPlusInt (Neg (Succ wy445))) (primPlusInt (Neg (Succ wy445)) (Neg wy446))) False)\n  Enum a",fontsize=16,color="black",shape="box"];18214 -> 18216[label="",style="solid", color="black", weight=3];
11974[label="Zero",fontsize=16,color="green",shape="box"];11975[label="Zero",fontsize=16,color="green",shape="box"];11976[label="Zero",fontsize=16,color="green",shape="box"];11977[label="Zero",fontsize=16,color="green",shape="box"];11978[label="Zero",fontsize=16,color="green",shape="box"];11979[label="Zero",fontsize=16,color="green",shape="box"];11980[label="Pos Zero",fontsize=16,color="green",shape="box"];11981[label="Zero",fontsize=16,color="green",shape="box"];11982[label="Zero",fontsize=16,color="green",shape="box"];11983[label="map toEnum (takeWhile2 (flip (>=) (Neg (Succ wy2710))) (primPlusInt (Neg (Succ wy274)) (Pos Zero) : iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (primPlusInt (Neg (Succ wy274)) (Pos Zero)))))\n  Enum a",fontsize=16,color="black",shape="box"];11983 -> 12049[label="",style="solid", color="black", weight=3];
11984[label="Zero",fontsize=16,color="green",shape="box"];11985[label="Zero",fontsize=16,color="green",shape="box"];11986[label="Zero",fontsize=16,color="green",shape="box"];11987[label="Zero",fontsize=16,color="green",shape="box"];11988[label="Zero",fontsize=16,color="green",shape="box"];11989[label="Zero",fontsize=16,color="green",shape="box"];11990[label="Pos Zero",fontsize=16,color="green",shape="box"];11991[label="Zero",fontsize=16,color="green",shape="box"];11992[label="Zero",fontsize=16,color="green",shape="box"];11993[label="map toEnum (takeWhile2 (flip (>=) (Neg Zero)) (primPlusInt (Neg (Succ wy274)) (Pos Zero) : iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (primPlusInt (Neg (Succ wy274)) (Pos Zero)))))\n  Enum a",fontsize=16,color="black",shape="box"];11993 -> 12050[label="",style="solid", color="black", weight=3];
7667[label="map toEnum (takeWhile1 (flip (>=) (Neg wy187)) (primPlusInt (Pos Zero) (Pos wy199)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos wy199)))) (compare (primPlusInt (Pos Zero) (Pos wy199)) (Neg wy187) /= LT))\n  Enum a",fontsize=16,color="black",shape="box"];7667 -> 7832[label="",style="solid", color="black", weight=3];
11623[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy252))) (primPlusInt (Pos (Succ wy254)) (Pos wy255)) (iterate (primPlusInt (Pos (Succ wy254))) (primPlusInt (Pos (Succ wy254)) (primPlusInt (Pos (Succ wy254)) (Pos wy255)))) (not (primCmpInt (primPlusInt (Pos (Succ wy254)) (Pos wy255)) (Pos (Succ wy252)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];11623 -> 11726[label="",style="solid", color="black", weight=3];
16074[label="map toEnum (Pos wy340 : takeWhile (flip (>=) (Pos (Succ wy339))) (iterate (primPlusInt (Pos (Succ wy341))) (primPlusInt (Pos (Succ wy341)) (Pos wy342))))\n  Enum a",fontsize=16,color="black",shape="box"];16074 -> 16142[label="",style="solid", color="black", weight=3];
16075[label="map toEnum (takeWhile0 (flip (>=) (Pos (Succ wy339))) (Pos wy340) (iterate (primPlusInt (Pos (Succ wy341))) (primPlusInt (Pos (Succ wy341)) (Pos wy342))) otherwise)\n  Enum a",fontsize=16,color="black",shape="box"];16075 -> 16143[label="",style="solid", color="black", weight=3];
17805[label="wy4260",fontsize=16,color="green",shape="box"];17806[label="wy4250",fontsize=16,color="green",shape="box"];17807[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy422))) (Pos (Succ wy423)) (iterate (primPlusInt (Neg (Succ wy424))) (primPlusInt (Neg (Succ wy424)) (Pos (Succ wy423)))) (not False))\n  Enum a",fontsize=16,color="black",shape="triangle"];17807 -> 17828[label="",style="solid", color="black", weight=3];
17808[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy422))) (Pos (Succ wy423)) (iterate (primPlusInt (Neg (Succ wy424))) (primPlusInt (Neg (Succ wy424)) (Pos (Succ wy423)))) (not True))\n  Enum a",fontsize=16,color="black",shape="box"];17808 -> 17829[label="",style="solid", color="black", weight=3];
17809 -> 17807[label="",style="dashed", color="red", weight=0];
17809[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy422))) (Pos (Succ wy423)) (iterate (primPlusInt (Neg (Succ wy424))) (primPlusInt (Neg (Succ wy424)) (Pos (Succ wy423)))) (not False))\n  Enum a",fontsize=16,color="magenta"];15914 -> 14841[label="",style="dashed", color="red", weight=0];
15914[label="map toEnum []\n  Enum a",fontsize=16,color="magenta"];15914 -> 15977[label="",style="dashed", color="magenta", weight=3];
15915[label="map toEnum (takeWhile0 (flip (>=) (Pos (Succ wy323))) (Pos Zero) (iterate (primPlusInt (Neg (Succ wy326))) (primPlusInt (Neg (Succ wy326)) (Pos Zero))) True)\n  Enum a",fontsize=16,color="black",shape="box"];15915 -> 15978[label="",style="solid", color="black", weight=3];
16140[label="map toEnum (Pos wy348 : takeWhile (flip (>=) (Pos (Succ wy347))) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy349))))\n  Enum a",fontsize=16,color="black",shape="box"];16140 -> 16214[label="",style="solid", color="black", weight=3];
16141[label="map toEnum (takeWhile0 (flip (>=) (Pos (Succ wy347))) (Pos wy348) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy349))) otherwise)\n  Enum a",fontsize=16,color="black",shape="box"];16141 -> 16215[label="",style="solid", color="black", weight=3];
7668[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Pos (Succ wy1920)) (Pos wy202)) (iterate (primPlusInt (Pos (Succ wy1920))) (primPlusInt (Pos (Succ wy1920)) (primPlusInt (Pos (Succ wy1920)) (Pos wy202)))) (not (compare (primPlusInt (Pos (Succ wy1920)) (Pos wy202)) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];7668 -> 7833[label="",style="solid", color="black", weight=3];
17461[label="Pos (Succ wy2670)",fontsize=16,color="green",shape="box"];11994[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Neg (Succ wy269)) (Pos (Succ wy2670))) (iterate (primPlusInt (Neg (Succ wy269))) (primPlusInt (Neg (Succ wy269)) (primPlusInt (Neg (Succ wy269)) (Pos (Succ wy2670))))) (flip (>=) (Pos Zero) (primPlusInt (Neg (Succ wy269)) (Pos (Succ wy2670)))))\n  Enum a",fontsize=16,color="black",shape="box"];11994 -> 12051[label="",style="solid", color="black", weight=3];
11995[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Neg (Succ wy269)) (Pos Zero)) (iterate (primPlusInt (Neg (Succ wy269))) (primPlusInt (Neg (Succ wy269)) (primPlusInt (Neg (Succ wy269)) (Pos Zero)))) ((>=) primPlusInt (Neg (Succ wy269)) (Pos Zero) Pos Zero))\n  Enum a",fontsize=16,color="black",shape="box"];11995 -> 12052[label="",style="solid", color="black", weight=3];
7691[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy205)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos wy205)))) (not (compare (primPlusInt (Pos Zero) (Pos wy205)) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];7691 -> 7866[label="",style="solid", color="black", weight=3];
11624 -> 5580[label="",style="dashed", color="red", weight=0];
11624[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy246))) (Pos (primPlusNat Zero wy248)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos (primPlusNat Zero wy248)))) (not (primCmpInt (Pos (primPlusNat Zero wy248)) (Pos (Succ wy246)) == GT)))\n  Enum a",fontsize=16,color="magenta"];11624 -> 11727[label="",style="dashed", color="magenta", weight=3];
11624 -> 11728[label="",style="dashed", color="magenta", weight=3];
11624 -> 11729[label="",style="dashed", color="magenta", weight=3];
11624 -> 11730[label="",style="dashed", color="magenta", weight=3];
17543[label="wy4050",fontsize=16,color="green",shape="box"];17544[label="wy4040",fontsize=16,color="green",shape="box"];17545[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy401))) (Pos (Succ wy402)) (iterate (primPlusInt (Neg (Succ wy403))) (primPlusInt (Neg (Succ wy403)) (Pos (Succ wy402)))) (not True))\n  Enum a",fontsize=16,color="black",shape="box"];17545 -> 17582[label="",style="solid", color="black", weight=3];
17546[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy401))) (Pos (Succ wy402)) (iterate (primPlusInt (Neg (Succ wy403))) (primPlusInt (Neg (Succ wy403)) (Pos (Succ wy402)))) (not False))\n  Enum a",fontsize=16,color="black",shape="triangle"];17546 -> 17583[label="",style="solid", color="black", weight=3];
17547 -> 17546[label="",style="dashed", color="red", weight=0];
17547[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy401))) (Pos (Succ wy402)) (iterate (primPlusInt (Neg (Succ wy403))) (primPlusInt (Neg (Succ wy403)) (Pos (Succ wy402)))) (not False))\n  Enum a",fontsize=16,color="magenta"];16267[label="map toEnum (Neg wy359 : takeWhile (flip (<=) (Pos (Succ wy306))) (iterate (primPlusInt (Neg (Succ wy309))) (primPlusInt (Neg (Succ wy309)) (Neg wy360))))\n  Enum a",fontsize=16,color="black",shape="box"];16267 -> 16337[label="",style="solid", color="black", weight=3];
15140[label="toEnum (Pos Zero) : map toEnum (takeWhile (flip (<=) (Pos (Succ wy306))) (iterate (primPlusInt (Neg (Succ wy309))) (primPlusInt (Neg (Succ wy309)) (Pos Zero))))\n  Enum a",fontsize=16,color="green",shape="box"];15140 -> 15234[label="",style="dashed", color="green", weight=3];
15140 -> 15235[label="",style="dashed", color="green", weight=3];
7698[label="map toEnum (takeWhile1 (flip (>=) (Neg wy187)) (primPlusInt (Pos (Succ wy1880)) (Pos wy196)) (iterate (primPlusInt (Pos (Succ wy1880))) (primPlusInt (Pos (Succ wy1880)) (primPlusInt (Pos (Succ wy1880)) (Pos wy196)))) (not (compare (primPlusInt (Pos (Succ wy1880)) (Pos wy196)) (Neg wy187) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];7698 -> 7874[label="",style="solid", color="black", weight=3];
12040[label="map toEnum (takeWhile1 (flip (>=) (Neg wy271)) (primPlusInt (Neg (Succ wy274)) (Pos (Succ wy2720))) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (primPlusInt (Neg (Succ wy274)) (Pos (Succ wy2720))))) ((>=) primPlusInt (Neg (Succ wy274)) (Pos (Succ wy2720)) Neg wy271))\n  Enum a",fontsize=16,color="black",shape="box"];12040 -> 12141[label="",style="solid", color="black", weight=3];
18215[label="map toEnum (Neg wy444 : takeWhile (flip (>=) (Neg (Succ wy443))) (iterate (primPlusInt (Neg (Succ wy445))) (primPlusInt (Neg (Succ wy445)) (Neg wy446))))\n  Enum a",fontsize=16,color="black",shape="box"];18215 -> 18217[label="",style="solid", color="black", weight=3];
18216[label="map toEnum (takeWhile0 (flip (>=) (Neg (Succ wy443))) (Neg wy444) (iterate (primPlusInt (Neg (Succ wy445))) (primPlusInt (Neg (Succ wy445)) (Neg wy446))) otherwise)\n  Enum a",fontsize=16,color="black",shape="box"];18216 -> 18218[label="",style="solid", color="black", weight=3];
12049[label="map toEnum (takeWhile1 (flip (>=) (Neg (Succ wy2710))) (primPlusInt (Neg (Succ wy274)) (Pos Zero)) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (primPlusInt (Neg (Succ wy274)) (Pos Zero)))) (flip (>=) (Neg (Succ wy2710)) (primPlusInt (Neg (Succ wy274)) (Pos Zero))))\n  Enum a",fontsize=16,color="black",shape="box"];12049 -> 12154[label="",style="solid", color="black", weight=3];
12050[label="map toEnum (takeWhile1 (flip (>=) (Neg Zero)) (primPlusInt (Neg (Succ wy274)) (Pos Zero)) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (primPlusInt (Neg (Succ wy274)) (Pos Zero)))) (flip (>=) (Neg Zero) (primPlusInt (Neg (Succ wy274)) (Pos Zero))))\n  Enum a",fontsize=16,color="black",shape="box"];12050 -> 12155[label="",style="solid", color="black", weight=3];
7832[label="map toEnum (takeWhile1 (flip (>=) (Neg wy187)) (primPlusInt (Pos Zero) (Pos wy199)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos wy199)))) (not (compare (primPlusInt (Pos Zero) (Pos wy199)) (Neg wy187) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];7832 -> 8073[label="",style="solid", color="black", weight=3];
11726 -> 5492[label="",style="dashed", color="red", weight=0];
11726[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy252))) (Pos (primPlusNat (Succ wy254) wy255)) (iterate (primPlusInt (Pos (Succ wy254))) (primPlusInt (Pos (Succ wy254)) (Pos (primPlusNat (Succ wy254) wy255)))) (not (primCmpInt (Pos (primPlusNat (Succ wy254) wy255)) (Pos (Succ wy252)) == GT)))\n  Enum a",fontsize=16,color="magenta"];11726 -> 11867[label="",style="dashed", color="magenta", weight=3];
11726 -> 11868[label="",style="dashed", color="magenta", weight=3];
11726 -> 11869[label="",style="dashed", color="magenta", weight=3];
11726 -> 11870[label="",style="dashed", color="magenta", weight=3];
11726 -> 11871[label="",style="dashed", color="magenta", weight=3];
16142[label="toEnum (Pos wy340) : map toEnum (takeWhile (flip (>=) (Pos (Succ wy339))) (iterate (primPlusInt (Pos (Succ wy341))) (primPlusInt (Pos (Succ wy341)) (Pos wy342))))\n  Enum a",fontsize=16,color="green",shape="box"];16142 -> 16216[label="",style="dashed", color="green", weight=3];
16142 -> 16217[label="",style="dashed", color="green", weight=3];
16143[label="map toEnum (takeWhile0 (flip (>=) (Pos (Succ wy339))) (Pos wy340) (iterate (primPlusInt (Pos (Succ wy341))) (primPlusInt (Pos (Succ wy341)) (Pos wy342))) True)\n  Enum a",fontsize=16,color="black",shape="box"];16143 -> 16218[label="",style="solid", color="black", weight=3];
17828[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy422))) (Pos (Succ wy423)) (iterate (primPlusInt (Neg (Succ wy424))) (primPlusInt (Neg (Succ wy424)) (Pos (Succ wy423)))) True)\n  Enum a",fontsize=16,color="black",shape="box"];17828 -> 17857[label="",style="solid", color="black", weight=3];
17829[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy422))) (Pos (Succ wy423)) (iterate (primPlusInt (Neg (Succ wy424))) (primPlusInt (Neg (Succ wy424)) (Pos (Succ wy423)))) False)\n  Enum a",fontsize=16,color="black",shape="box"];17829 -> 17858[label="",style="solid", color="black", weight=3];
15977[label="toEnum\n  Enum a",fontsize=16,color="grey",shape="box"];15977 -> 16037[label="",style="dashed", color="grey", weight=3];
14841[label="map wy301 []",fontsize=16,color="black",shape="triangle"];14841 -> 15074[label="",style="solid", color="black", weight=3];
15978 -> 14841[label="",style="dashed", color="red", weight=0];
15978[label="map toEnum []\n  Enum a",fontsize=16,color="magenta"];15978 -> 16038[label="",style="dashed", color="magenta", weight=3];
16214[label="toEnum (Pos wy348) : map toEnum (takeWhile (flip (>=) (Pos (Succ wy347))) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy349))))\n  Enum a",fontsize=16,color="green",shape="box"];16214 -> 16270[label="",style="dashed", color="green", weight=3];
16214 -> 16271[label="",style="dashed", color="green", weight=3];
16215[label="map toEnum (takeWhile0 (flip (>=) (Pos (Succ wy347))) (Pos wy348) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy349))) True)\n  Enum a",fontsize=16,color="black",shape="box"];16215 -> 16272[label="",style="solid", color="black", weight=3];
7833[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Pos (Succ wy1920)) (Pos wy202)) (iterate (primPlusInt (Pos (Succ wy1920))) (primPlusInt (Pos (Succ wy1920)) (primPlusInt (Pos (Succ wy1920)) (Pos wy202)))) (not (primCmpInt (primPlusInt (Pos (Succ wy1920)) (Pos wy202)) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];7833 -> 8074[label="",style="solid", color="black", weight=3];
12051[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Neg (Succ wy269)) (Pos (Succ wy2670))) (iterate (primPlusInt (Neg (Succ wy269))) (primPlusInt (Neg (Succ wy269)) (primPlusInt (Neg (Succ wy269)) (Pos (Succ wy2670))))) ((>=) primPlusInt (Neg (Succ wy269)) (Pos (Succ wy2670)) Pos Zero))\n  Enum a",fontsize=16,color="black",shape="box"];12051 -> 12156[label="",style="solid", color="black", weight=3];
12052[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Neg (Succ wy269)) (Pos Zero)) (iterate (primPlusInt (Neg (Succ wy269))) (primPlusInt (Neg (Succ wy269)) (primPlusInt (Neg (Succ wy269)) (Pos Zero)))) (compare (primPlusInt (Neg (Succ wy269)) (Pos Zero)) (Pos Zero) /= LT))\n  Enum a",fontsize=16,color="black",shape="box"];12052 -> 12157[label="",style="solid", color="black", weight=3];
7866[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy205)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos wy205)))) (not (primCmpInt (primPlusInt (Pos Zero) (Pos wy205)) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];7866 -> 8099[label="",style="solid", color="black", weight=3];
11727 -> 5172[label="",style="dashed", color="red", weight=0];
11727[label="primPlusNat Zero wy248",fontsize=16,color="magenta"];11727 -> 11872[label="",style="dashed", color="magenta", weight=3];
11727 -> 11873[label="",style="dashed", color="magenta", weight=3];
11728 -> 5172[label="",style="dashed", color="red", weight=0];
11728[label="primPlusNat Zero wy248",fontsize=16,color="magenta"];11728 -> 11874[label="",style="dashed", color="magenta", weight=3];
11728 -> 11875[label="",style="dashed", color="magenta", weight=3];
11729[label="wy246",fontsize=16,color="green",shape="box"];11730 -> 5172[label="",style="dashed", color="red", weight=0];
11730[label="primPlusNat Zero wy248",fontsize=16,color="magenta"];11730 -> 11876[label="",style="dashed", color="magenta", weight=3];
11730 -> 11877[label="",style="dashed", color="magenta", weight=3];
17582[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy401))) (Pos (Succ wy402)) (iterate (primPlusInt (Neg (Succ wy403))) (primPlusInt (Neg (Succ wy403)) (Pos (Succ wy402)))) False)\n  Enum a",fontsize=16,color="black",shape="box"];17582 -> 17620[label="",style="solid", color="black", weight=3];
17583[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy401))) (Pos (Succ wy402)) (iterate (primPlusInt (Neg (Succ wy403))) (primPlusInt (Neg (Succ wy403)) (Pos (Succ wy402)))) True)\n  Enum a",fontsize=16,color="black",shape="box"];17583 -> 17621[label="",style="solid", color="black", weight=3];
16337[label="toEnum (Neg wy359) : map toEnum (takeWhile (flip (<=) (Pos (Succ wy306))) (iterate (primPlusInt (Neg (Succ wy309))) (primPlusInt (Neg (Succ wy309)) (Neg wy360))))\n  Enum a",fontsize=16,color="green",shape="box"];16337 -> 16427[label="",style="dashed", color="green", weight=3];
16337 -> 16428[label="",style="dashed", color="green", weight=3];
15234[label="toEnum (Pos Zero)\n  Enum a",fontsize=16,color="blue",shape="box"];18856[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];15234 -> 18856[label="",style="solid", color="blue", weight=9];
18856 -> 15304[label="",style="solid", color="blue", weight=3];
18857[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];15234 -> 18857[label="",style="solid", color="blue", weight=9];
18857 -> 15305[label="",style="solid", color="blue", weight=3];
18858[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];15234 -> 18858[label="",style="solid", color="blue", weight=9];
18858 -> 15306[label="",style="solid", color="blue", weight=3];
18859[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];15234 -> 18859[label="",style="solid", color="blue", weight=9];
18859 -> 15307[label="",style="solid", color="blue", weight=3];
18860[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];15234 -> 18860[label="",style="solid", color="blue", weight=9];
18860 -> 15308[label="",style="solid", color="blue", weight=3];
18861[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];15234 -> 18861[label="",style="solid", color="blue", weight=9];
18861 -> 15309[label="",style="solid", color="blue", weight=3];
18862[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];15234 -> 18862[label="",style="solid", color="blue", weight=9];
18862 -> 15310[label="",style="solid", color="blue", weight=3];
18863[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];15234 -> 18863[label="",style="solid", color="blue", weight=9];
18863 -> 15311[label="",style="solid", color="blue", weight=3];
18864[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];15234 -> 18864[label="",style="solid", color="blue", weight=9];
18864 -> 15312[label="",style="solid", color="blue", weight=3];
15235[label="map toEnum (takeWhile (flip (<=) (Pos (Succ wy306))) (iterate (primPlusInt (Neg (Succ wy309))) (primPlusInt (Neg (Succ wy309)) (Pos Zero))))\n  Enum a",fontsize=16,color="black",shape="box"];15235 -> 15313[label="",style="solid", color="black", weight=3];
7874[label="map toEnum (takeWhile1 (flip (>=) (Neg wy187)) (primPlusInt (Pos (Succ wy1880)) (Pos wy196)) (iterate (primPlusInt (Pos (Succ wy1880))) (primPlusInt (Pos (Succ wy1880)) (primPlusInt (Pos (Succ wy1880)) (Pos wy196)))) (not (primCmpInt (primPlusInt (Pos (Succ wy1880)) (Pos wy196)) (Neg wy187) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];7874 -> 8105[label="",style="solid", color="black", weight=3];
12141[label="map toEnum (takeWhile1 (flip (>=) (Neg wy271)) (primPlusInt (Neg (Succ wy274)) (Pos (Succ wy2720))) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (primPlusInt (Neg (Succ wy274)) (Pos (Succ wy2720))))) (compare (primPlusInt (Neg (Succ wy274)) (Pos (Succ wy2720))) (Neg wy271) /= LT))\n  Enum a",fontsize=16,color="black",shape="box"];12141 -> 12301[label="",style="solid", color="black", weight=3];
18217[label="toEnum (Neg wy444) : map toEnum (takeWhile (flip (>=) (Neg (Succ wy443))) (iterate (primPlusInt (Neg (Succ wy445))) (primPlusInt (Neg (Succ wy445)) (Neg wy446))))\n  Enum a",fontsize=16,color="green",shape="box"];18217 -> 18219[label="",style="dashed", color="green", weight=3];
18217 -> 18220[label="",style="dashed", color="green", weight=3];
18218[label="map toEnum (takeWhile0 (flip (>=) (Neg (Succ wy443))) (Neg wy444) (iterate (primPlusInt (Neg (Succ wy445))) (primPlusInt (Neg (Succ wy445)) (Neg wy446))) True)\n  Enum a",fontsize=16,color="black",shape="box"];18218 -> 18221[label="",style="solid", color="black", weight=3];
12154[label="map toEnum (takeWhile1 (flip (>=) (Neg (Succ wy2710))) (primPlusInt (Neg (Succ wy274)) (Pos Zero)) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (primPlusInt (Neg (Succ wy274)) (Pos Zero)))) ((>=) primPlusInt (Neg (Succ wy274)) (Pos Zero) Neg (Succ wy2710)))\n  Enum a",fontsize=16,color="black",shape="box"];12154 -> 12329[label="",style="solid", color="black", weight=3];
12155[label="map toEnum (takeWhile1 (flip (>=) (Neg Zero)) (primPlusInt (Neg (Succ wy274)) (Pos Zero)) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (primPlusInt (Neg (Succ wy274)) (Pos Zero)))) ((>=) primPlusInt (Neg (Succ wy274)) (Pos Zero) Neg Zero))\n  Enum a",fontsize=16,color="black",shape="box"];12155 -> 12330[label="",style="solid", color="black", weight=3];
8073[label="map toEnum (takeWhile1 (flip (>=) (Neg wy187)) (primPlusInt (Pos Zero) (Pos wy199)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos wy199)))) (not (primCmpInt (primPlusInt (Pos Zero) (Pos wy199)) (Neg wy187) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];8073 -> 8332[label="",style="solid", color="black", weight=3];
11867 -> 5172[label="",style="dashed", color="red", weight=0];
11867[label="primPlusNat (Succ wy254) wy255",fontsize=16,color="magenta"];11867 -> 11996[label="",style="dashed", color="magenta", weight=3];
11867 -> 11997[label="",style="dashed", color="magenta", weight=3];
11868[label="wy254",fontsize=16,color="green",shape="box"];11869[label="wy252",fontsize=16,color="green",shape="box"];11870 -> 5172[label="",style="dashed", color="red", weight=0];
11870[label="primPlusNat (Succ wy254) wy255",fontsize=16,color="magenta"];11870 -> 11998[label="",style="dashed", color="magenta", weight=3];
11870 -> 11999[label="",style="dashed", color="magenta", weight=3];
11871 -> 5172[label="",style="dashed", color="red", weight=0];
11871[label="primPlusNat (Succ wy254) wy255",fontsize=16,color="magenta"];11871 -> 12000[label="",style="dashed", color="magenta", weight=3];
11871 -> 12001[label="",style="dashed", color="magenta", weight=3];
16216[label="toEnum (Pos wy340)\n  Enum a",fontsize=16,color="blue",shape="box"];18868[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];16216 -> 18868[label="",style="solid", color="blue", weight=9];
18868 -> 16273[label="",style="solid", color="blue", weight=3];
18869[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];16216 -> 18869[label="",style="solid", color="blue", weight=9];
18869 -> 16274[label="",style="solid", color="blue", weight=3];
18870[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];16216 -> 18870[label="",style="solid", color="blue", weight=9];
18870 -> 16275[label="",style="solid", color="blue", weight=3];
18871[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];16216 -> 18871[label="",style="solid", color="blue", weight=9];
18871 -> 16276[label="",style="solid", color="blue", weight=3];
18872[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];16216 -> 18872[label="",style="solid", color="blue", weight=9];
18872 -> 16277[label="",style="solid", color="blue", weight=3];
18873[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];16216 -> 18873[label="",style="solid", color="blue", weight=9];
18873 -> 16278[label="",style="solid", color="blue", weight=3];
18874[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];16216 -> 18874[label="",style="solid", color="blue", weight=9];
18874 -> 16279[label="",style="solid", color="blue", weight=3];
18875[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];16216 -> 18875[label="",style="solid", color="blue", weight=9];
18875 -> 16280[label="",style="solid", color="blue", weight=3];
18876[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];16216 -> 18876[label="",style="solid", color="blue", weight=9];
18876 -> 16281[label="",style="solid", color="blue", weight=3];
16217[label="map toEnum (takeWhile (flip (>=) (Pos (Succ wy339))) (iterate (primPlusInt (Pos (Succ wy341))) (primPlusInt (Pos (Succ wy341)) (Pos wy342))))\n  Enum a",fontsize=16,color="black",shape="box"];16217 -> 16282[label="",style="solid", color="black", weight=3];
16218 -> 14841[label="",style="dashed", color="red", weight=0];
16218[label="map toEnum []\n  Enum a",fontsize=16,color="magenta"];16218 -> 16283[label="",style="dashed", color="magenta", weight=3];
17857[label="map toEnum (Pos (Succ wy423) : takeWhile (flip (>=) (Pos (Succ wy422))) (iterate (primPlusInt (Neg (Succ wy424))) (primPlusInt (Neg (Succ wy424)) (Pos (Succ wy423)))))\n  Enum a",fontsize=16,color="black",shape="box"];17857 -> 17876[label="",style="solid", color="black", weight=3];
17858[label="map toEnum (takeWhile0 (flip (>=) (Pos (Succ wy422))) (Pos (Succ wy423)) (iterate (primPlusInt (Neg (Succ wy424))) (primPlusInt (Neg (Succ wy424)) (Pos (Succ wy423)))) otherwise)\n  Enum a",fontsize=16,color="black",shape="box"];17858 -> 17877[label="",style="solid", color="black", weight=3];
16037[label="toEnum wy362\n  Enum a",fontsize=16,color="blue",shape="box"];18878[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];16037 -> 18878[label="",style="solid", color="blue", weight=9];
18878 -> 16084[label="",style="solid", color="blue", weight=3];
18879[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];16037 -> 18879[label="",style="solid", color="blue", weight=9];
18879 -> 16085[label="",style="solid", color="blue", weight=3];
18880[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];16037 -> 18880[label="",style="solid", color="blue", weight=9];
18880 -> 16086[label="",style="solid", color="blue", weight=3];
18881[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];16037 -> 18881[label="",style="solid", color="blue", weight=9];
18881 -> 16087[label="",style="solid", color="blue", weight=3];
18882[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];16037 -> 18882[label="",style="solid", color="blue", weight=9];
18882 -> 16088[label="",style="solid", color="blue", weight=3];
18883[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];16037 -> 18883[label="",style="solid", color="blue", weight=9];
18883 -> 16089[label="",style="solid", color="blue", weight=3];
18884[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];16037 -> 18884[label="",style="solid", color="blue", weight=9];
18884 -> 16090[label="",style="solid", color="blue", weight=3];
18885[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];16037 -> 18885[label="",style="solid", color="blue", weight=9];
18885 -> 16091[label="",style="solid", color="blue", weight=3];
18886[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];16037 -> 18886[label="",style="solid", color="blue", weight=9];
18886 -> 16092[label="",style="solid", color="blue", weight=3];
15074[label="[]",fontsize=16,color="green",shape="box"];16038[label="toEnum\n  Enum a",fontsize=16,color="grey",shape="box"];16038 -> 16093[label="",style="dashed", color="grey", weight=3];
16270[label="toEnum (Pos wy348)\n  Enum a",fontsize=16,color="blue",shape="box"];18887[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];16270 -> 18887[label="",style="solid", color="blue", weight=9];
18887 -> 16341[label="",style="solid", color="blue", weight=3];
18888[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];16270 -> 18888[label="",style="solid", color="blue", weight=9];
18888 -> 16342[label="",style="solid", color="blue", weight=3];
18889[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];16270 -> 18889[label="",style="solid", color="blue", weight=9];
18889 -> 16343[label="",style="solid", color="blue", weight=3];
18890[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];16270 -> 18890[label="",style="solid", color="blue", weight=9];
18890 -> 16344[label="",style="solid", color="blue", weight=3];
18891[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];16270 -> 18891[label="",style="solid", color="blue", weight=9];
18891 -> 16345[label="",style="solid", color="blue", weight=3];
18892[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];16270 -> 18892[label="",style="solid", color="blue", weight=9];
18892 -> 16346[label="",style="solid", color="blue", weight=3];
18893[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];16270 -> 18893[label="",style="solid", color="blue", weight=9];
18893 -> 16347[label="",style="solid", color="blue", weight=3];
18894[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];16270 -> 18894[label="",style="solid", color="blue", weight=9];
18894 -> 16348[label="",style="solid", color="blue", weight=3];
18895[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];16270 -> 18895[label="",style="solid", color="blue", weight=9];
18895 -> 16349[label="",style="solid", color="blue", weight=3];
16271[label="map toEnum (takeWhile (flip (>=) (Pos (Succ wy347))) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos wy349))))\n  Enum a",fontsize=16,color="black",shape="box"];16271 -> 16350[label="",style="solid", color="black", weight=3];
16272 -> 14841[label="",style="dashed", color="red", weight=0];
16272[label="map toEnum []\n  Enum a",fontsize=16,color="magenta"];16272 -> 16351[label="",style="dashed", color="magenta", weight=3];
8074 -> 6330[label="",style="dashed", color="red", weight=0];
8074[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (primPlusNat (Succ wy1920) wy202)) (iterate (primPlusInt (Pos (Succ wy1920))) (primPlusInt (Pos (Succ wy1920)) (Pos (primPlusNat (Succ wy1920) wy202)))) (not (primCmpInt (Pos (primPlusNat (Succ wy1920) wy202)) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="magenta"];8074 -> 8333[label="",style="dashed", color="magenta", weight=3];
8074 -> 8334[label="",style="dashed", color="magenta", weight=3];
8074 -> 8335[label="",style="dashed", color="magenta", weight=3];
12156[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Neg (Succ wy269)) (Pos (Succ wy2670))) (iterate (primPlusInt (Neg (Succ wy269))) (primPlusInt (Neg (Succ wy269)) (primPlusInt (Neg (Succ wy269)) (Pos (Succ wy2670))))) (compare (primPlusInt (Neg (Succ wy269)) (Pos (Succ wy2670))) (Pos Zero) /= LT))\n  Enum a",fontsize=16,color="black",shape="box"];12156 -> 12331[label="",style="solid", color="black", weight=3];
12157[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Neg (Succ wy269)) (Pos Zero)) (iterate (primPlusInt (Neg (Succ wy269))) (primPlusInt (Neg (Succ wy269)) (primPlusInt (Neg (Succ wy269)) (Pos Zero)))) (not (compare (primPlusInt (Neg (Succ wy269)) (Pos Zero)) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];12157 -> 12332[label="",style="solid", color="black", weight=3];
8099 -> 6335[label="",style="dashed", color="red", weight=0];
8099[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (Pos (primPlusNat Zero wy205)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos (primPlusNat Zero wy205)))) (not (primCmpInt (Pos (primPlusNat Zero wy205)) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="magenta"];8099 -> 8361[label="",style="dashed", color="magenta", weight=3];
8099 -> 8362[label="",style="dashed", color="magenta", weight=3];
8099 -> 8363[label="",style="dashed", color="magenta", weight=3];
11872[label="wy248",fontsize=16,color="green",shape="box"];11873[label="Zero",fontsize=16,color="green",shape="box"];11874[label="wy248",fontsize=16,color="green",shape="box"];11875[label="Zero",fontsize=16,color="green",shape="box"];11876[label="wy248",fontsize=16,color="green",shape="box"];11877[label="Zero",fontsize=16,color="green",shape="box"];17620[label="map toEnum (takeWhile0 (flip (<=) (Pos (Succ wy401))) (Pos (Succ wy402)) (iterate (primPlusInt (Neg (Succ wy403))) (primPlusInt (Neg (Succ wy403)) (Pos (Succ wy402)))) otherwise)\n  Enum a",fontsize=16,color="black",shape="box"];17620 -> 17634[label="",style="solid", color="black", weight=3];
17621[label="map toEnum (Pos (Succ wy402) : takeWhile (flip (<=) (Pos (Succ wy401))) (iterate (primPlusInt (Neg (Succ wy403))) (primPlusInt (Neg (Succ wy403)) (Pos (Succ wy402)))))\n  Enum a",fontsize=16,color="black",shape="box"];17621 -> 17635[label="",style="solid", color="black", weight=3];
16427[label="toEnum (Neg wy359)\n  Enum a",fontsize=16,color="blue",shape="box"];18899[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];16427 -> 18899[label="",style="solid", color="blue", weight=9];
18899 -> 16540[label="",style="solid", color="blue", weight=3];
18900[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];16427 -> 18900[label="",style="solid", color="blue", weight=9];
18900 -> 16541[label="",style="solid", color="blue", weight=3];
18901[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];16427 -> 18901[label="",style="solid", color="blue", weight=9];
18901 -> 16542[label="",style="solid", color="blue", weight=3];
18902[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];16427 -> 18902[label="",style="solid", color="blue", weight=9];
18902 -> 16543[label="",style="solid", color="blue", weight=3];
18903[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];16427 -> 18903[label="",style="solid", color="blue", weight=9];
18903 -> 16544[label="",style="solid", color="blue", weight=3];
18904[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];16427 -> 18904[label="",style="solid", color="blue", weight=9];
18904 -> 16545[label="",style="solid", color="blue", weight=3];
18905[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];16427 -> 18905[label="",style="solid", color="blue", weight=9];
18905 -> 16546[label="",style="solid", color="blue", weight=3];
18906[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];16427 -> 18906[label="",style="solid", color="blue", weight=9];
18906 -> 16547[label="",style="solid", color="blue", weight=3];
18907[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];16427 -> 18907[label="",style="solid", color="blue", weight=9];
18907 -> 16548[label="",style="solid", color="blue", weight=3];
16428[label="map toEnum (takeWhile (flip (<=) (Pos (Succ wy306))) (iterate (primPlusInt (Neg (Succ wy309))) (primPlusInt (Neg (Succ wy309)) (Neg wy360))))\n  Enum a",fontsize=16,color="black",shape="box"];16428 -> 16549[label="",style="solid", color="black", weight=3];
15304 -> 12260[label="",style="dashed", color="red", weight=0];
15304[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];15304 -> 15356[label="",style="dashed", color="magenta", weight=3];
15305 -> 12261[label="",style="dashed", color="red", weight=0];
15305[label="toEnum (Pos Zero)\n  Integral a",fontsize=16,color="magenta"];15305 -> 15357[label="",style="dashed", color="magenta", weight=3];
15306 -> 12262[label="",style="dashed", color="red", weight=0];
15306[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];15306 -> 15358[label="",style="dashed", color="magenta", weight=3];
15307 -> 12263[label="",style="dashed", color="red", weight=0];
15307[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];15307 -> 15359[label="",style="dashed", color="magenta", weight=3];
15308 -> 12264[label="",style="dashed", color="red", weight=0];
15308[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];15308 -> 15360[label="",style="dashed", color="magenta", weight=3];
15309 -> 12265[label="",style="dashed", color="red", weight=0];
15309[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];15309 -> 15361[label="",style="dashed", color="magenta", weight=3];
15310 -> 352[label="",style="dashed", color="red", weight=0];
15310[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];15310 -> 15362[label="",style="dashed", color="magenta", weight=3];
15311 -> 12267[label="",style="dashed", color="red", weight=0];
15311[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];15311 -> 15363[label="",style="dashed", color="magenta", weight=3];
15312 -> 12268[label="",style="dashed", color="red", weight=0];
15312[label="toEnum (Pos Zero)",fontsize=16,color="magenta"];15312 -> 15364[label="",style="dashed", color="magenta", weight=3];
15313[label="map toEnum (takeWhile (flip (<=) (Pos (Succ wy306))) (primPlusInt (Neg (Succ wy309)) (Pos Zero) : iterate (primPlusInt (Neg (Succ wy309))) (primPlusInt (Neg (Succ wy309)) (primPlusInt (Neg (Succ wy309)) (Pos Zero)))))\n  Enum a",fontsize=16,color="black",shape="box"];15313 -> 15365[label="",style="solid", color="black", weight=3];
8105 -> 6316[label="",style="dashed", color="red", weight=0];
8105[label="map toEnum (takeWhile1 (flip (>=) (Neg wy187)) (Pos (primPlusNat (Succ wy1880) wy196)) (iterate (primPlusInt (Pos (Succ wy1880))) (primPlusInt (Pos (Succ wy1880)) (Pos (primPlusNat (Succ wy1880) wy196)))) (not (primCmpInt (Pos (primPlusNat (Succ wy1880) wy196)) (Neg wy187) == LT)))\n  Enum a",fontsize=16,color="magenta"];8105 -> 8370[label="",style="dashed", color="magenta", weight=3];
8105 -> 8371[label="",style="dashed", color="magenta", weight=3];
8105 -> 8372[label="",style="dashed", color="magenta", weight=3];
12301[label="map toEnum (takeWhile1 (flip (>=) (Neg wy271)) (primPlusInt (Neg (Succ wy274)) (Pos (Succ wy2720))) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (primPlusInt (Neg (Succ wy274)) (Pos (Succ wy2720))))) (not (compare (primPlusInt (Neg (Succ wy274)) (Pos (Succ wy2720))) (Neg wy271) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];12301 -> 12475[label="",style="solid", color="black", weight=3];
18219[label="toEnum (Neg wy444)\n  Enum a",fontsize=16,color="blue",shape="box"];18918[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];18219 -> 18918[label="",style="solid", color="blue", weight=9];
18918 -> 18222[label="",style="solid", color="blue", weight=3];
18919[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];18219 -> 18919[label="",style="solid", color="blue", weight=9];
18919 -> 18223[label="",style="solid", color="blue", weight=3];
18920[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];18219 -> 18920[label="",style="solid", color="blue", weight=9];
18920 -> 18224[label="",style="solid", color="blue", weight=3];
18921[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];18219 -> 18921[label="",style="solid", color="blue", weight=9];
18921 -> 18225[label="",style="solid", color="blue", weight=3];
18922[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];18219 -> 18922[label="",style="solid", color="blue", weight=9];
18922 -> 18226[label="",style="solid", color="blue", weight=3];
18923[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];18219 -> 18923[label="",style="solid", color="blue", weight=9];
18923 -> 18227[label="",style="solid", color="blue", weight=3];
18924[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];18219 -> 18924[label="",style="solid", color="blue", weight=9];
18924 -> 18228[label="",style="solid", color="blue", weight=3];
18925[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];18219 -> 18925[label="",style="solid", color="blue", weight=9];
18925 -> 18229[label="",style="solid", color="blue", weight=3];
18926[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];18219 -> 18926[label="",style="solid", color="blue", weight=9];
18926 -> 18230[label="",style="solid", color="blue", weight=3];
18220[label="map toEnum (takeWhile (flip (>=) (Neg (Succ wy443))) (iterate (primPlusInt (Neg (Succ wy445))) (primPlusInt (Neg (Succ wy445)) (Neg wy446))))\n  Enum a",fontsize=16,color="black",shape="box"];18220 -> 18231[label="",style="solid", color="black", weight=3];
18221 -> 14841[label="",style="dashed", color="red", weight=0];
18221[label="map toEnum []\n  Enum a",fontsize=16,color="magenta"];18221 -> 18232[label="",style="dashed", color="magenta", weight=3];
12329[label="map toEnum (takeWhile1 (flip (>=) (Neg (Succ wy2710))) (primPlusInt (Neg (Succ wy274)) (Pos Zero)) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (primPlusInt (Neg (Succ wy274)) (Pos Zero)))) (compare (primPlusInt (Neg (Succ wy274)) (Pos Zero)) (Neg (Succ wy2710)) /= LT))\n  Enum a",fontsize=16,color="black",shape="box"];12329 -> 12496[label="",style="solid", color="black", weight=3];
12330[label="map toEnum (takeWhile1 (flip (>=) (Neg Zero)) (primPlusInt (Neg (Succ wy274)) (Pos Zero)) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (primPlusInt (Neg (Succ wy274)) (Pos Zero)))) (compare (primPlusInt (Neg (Succ wy274)) (Pos Zero)) (Neg Zero) /= LT))\n  Enum a",fontsize=16,color="black",shape="box"];12330 -> 12497[label="",style="solid", color="black", weight=3];
8332 -> 6326[label="",style="dashed", color="red", weight=0];
8332[label="map toEnum (takeWhile1 (flip (>=) (Neg wy187)) (Pos (primPlusNat Zero wy199)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos (primPlusNat Zero wy199)))) (not (primCmpInt (Pos (primPlusNat Zero wy199)) (Neg wy187) == LT)))\n  Enum a",fontsize=16,color="magenta"];8332 -> 8447[label="",style="dashed", color="magenta", weight=3];
8332 -> 8448[label="",style="dashed", color="magenta", weight=3];
8332 -> 8449[label="",style="dashed", color="magenta", weight=3];
11996[label="wy255",fontsize=16,color="green",shape="box"];11997[label="Succ wy254",fontsize=16,color="green",shape="box"];11998[label="wy255",fontsize=16,color="green",shape="box"];11999[label="Succ wy254",fontsize=16,color="green",shape="box"];12000[label="wy255",fontsize=16,color="green",shape="box"];12001[label="Succ wy254",fontsize=16,color="green",shape="box"];16273 -> 12260[label="",style="dashed", color="red", weight=0];
16273[label="toEnum (Pos wy340)",fontsize=16,color="magenta"];16273 -> 16352[label="",style="dashed", color="magenta", weight=3];
16274 -> 12261[label="",style="dashed", color="red", weight=0];
16274[label="toEnum (Pos wy340)\n  Integral a",fontsize=16,color="magenta"];16274 -> 16353[label="",style="dashed", color="magenta", weight=3];
16275 -> 12262[label="",style="dashed", color="red", weight=0];
16275[label="toEnum (Pos wy340)",fontsize=16,color="magenta"];16275 -> 16354[label="",style="dashed", color="magenta", weight=3];
16276 -> 12263[label="",style="dashed", color="red", weight=0];
16276[label="toEnum (Pos wy340)",fontsize=16,color="magenta"];16276 -> 16355[label="",style="dashed", color="magenta", weight=3];
16277 -> 12264[label="",style="dashed", color="red", weight=0];
16277[label="toEnum (Pos wy340)",fontsize=16,color="magenta"];16277 -> 16356[label="",style="dashed", color="magenta", weight=3];
16278 -> 12265[label="",style="dashed", color="red", weight=0];
16278[label="toEnum (Pos wy340)",fontsize=16,color="magenta"];16278 -> 16357[label="",style="dashed", color="magenta", weight=3];
16279 -> 352[label="",style="dashed", color="red", weight=0];
16279[label="toEnum (Pos wy340)",fontsize=16,color="magenta"];16279 -> 16358[label="",style="dashed", color="magenta", weight=3];
16280 -> 12267[label="",style="dashed", color="red", weight=0];
16280[label="toEnum (Pos wy340)",fontsize=16,color="magenta"];16280 -> 16359[label="",style="dashed", color="magenta", weight=3];
16281 -> 12268[label="",style="dashed", color="red", weight=0];
16281[label="toEnum (Pos wy340)",fontsize=16,color="magenta"];16281 -> 16360[label="",style="dashed", color="magenta", weight=3];
16282[label="map toEnum (takeWhile (flip (>=) (Pos (Succ wy339))) (primPlusInt (Pos (Succ wy341)) (Pos wy342) : iterate (primPlusInt (Pos (Succ wy341))) (primPlusInt (Pos (Succ wy341)) (primPlusInt (Pos (Succ wy341)) (Pos wy342)))))\n  Enum a",fontsize=16,color="black",shape="box"];16282 -> 16361[label="",style="solid", color="black", weight=3];
16283[label="toEnum\n  Enum a",fontsize=16,color="grey",shape="box"];16283 -> 16362[label="",style="dashed", color="grey", weight=3];
17876[label="toEnum (Pos (Succ wy423)) : map toEnum (takeWhile (flip (>=) (Pos (Succ wy422))) (iterate (primPlusInt (Neg (Succ wy424))) (primPlusInt (Neg (Succ wy424)) (Pos (Succ wy423)))))\n  Enum a",fontsize=16,color="green",shape="box"];17876 -> 17887[label="",style="dashed", color="green", weight=3];
17876 -> 17888[label="",style="dashed", color="green", weight=3];
17877[label="map toEnum (takeWhile0 (flip (>=) (Pos (Succ wy422))) (Pos (Succ wy423)) (iterate (primPlusInt (Neg (Succ wy424))) (primPlusInt (Neg (Succ wy424)) (Pos (Succ wy423)))) True)\n  Enum a",fontsize=16,color="black",shape="box"];17877 -> 17889[label="",style="solid", color="black", weight=3];
16084 -> 12260[label="",style="dashed", color="red", weight=0];
16084[label="toEnum wy362",fontsize=16,color="magenta"];16084 -> 16156[label="",style="dashed", color="magenta", weight=3];
16085 -> 12261[label="",style="dashed", color="red", weight=0];
16085[label="toEnum wy362\n  Integral a",fontsize=16,color="magenta"];16085 -> 16157[label="",style="dashed", color="magenta", weight=3];
16086 -> 12262[label="",style="dashed", color="red", weight=0];
16086[label="toEnum wy362",fontsize=16,color="magenta"];16086 -> 16158[label="",style="dashed", color="magenta", weight=3];
16087 -> 12263[label="",style="dashed", color="red", weight=0];
16087[label="toEnum wy362",fontsize=16,color="magenta"];16087 -> 16159[label="",style="dashed", color="magenta", weight=3];
16088 -> 12264[label="",style="dashed", color="red", weight=0];
16088[label="toEnum wy362",fontsize=16,color="magenta"];16088 -> 16160[label="",style="dashed", color="magenta", weight=3];
16089 -> 12265[label="",style="dashed", color="red", weight=0];
16089[label="toEnum wy362",fontsize=16,color="magenta"];16089 -> 16161[label="",style="dashed", color="magenta", weight=3];
16090 -> 352[label="",style="dashed", color="red", weight=0];
16090[label="toEnum wy362",fontsize=16,color="magenta"];16090 -> 16162[label="",style="dashed", color="magenta", weight=3];
16091 -> 12267[label="",style="dashed", color="red", weight=0];
16091[label="toEnum wy362",fontsize=16,color="magenta"];16091 -> 16163[label="",style="dashed", color="magenta", weight=3];
16092 -> 12268[label="",style="dashed", color="red", weight=0];
16092[label="toEnum wy362",fontsize=16,color="magenta"];16092 -> 16164[label="",style="dashed", color="magenta", weight=3];
16093[label="toEnum wy363\n  Enum a",fontsize=16,color="blue",shape="box"];18947[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];16093 -> 18947[label="",style="solid", color="blue", weight=9];
18947 -> 16165[label="",style="solid", color="blue", weight=3];
18948[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];16093 -> 18948[label="",style="solid", color="blue", weight=9];
18948 -> 16166[label="",style="solid", color="blue", weight=3];
18949[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];16093 -> 18949[label="",style="solid", color="blue", weight=9];
18949 -> 16167[label="",style="solid", color="blue", weight=3];
18950[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];16093 -> 18950[label="",style="solid", color="blue", weight=9];
18950 -> 16168[label="",style="solid", color="blue", weight=3];
18951[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];16093 -> 18951[label="",style="solid", color="blue", weight=9];
18951 -> 16169[label="",style="solid", color="blue", weight=3];
18952[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];16093 -> 18952[label="",style="solid", color="blue", weight=9];
18952 -> 16170[label="",style="solid", color="blue", weight=3];
18953[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];16093 -> 18953[label="",style="solid", color="blue", weight=9];
18953 -> 16171[label="",style="solid", color="blue", weight=3];
18954[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];16093 -> 18954[label="",style="solid", color="blue", weight=9];
18954 -> 16172[label="",style="solid", color="blue", weight=3];
18955[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];16093 -> 18955[label="",style="solid", color="blue", weight=9];
18955 -> 16173[label="",style="solid", color="blue", weight=3];
16341 -> 12260[label="",style="dashed", color="red", weight=0];
16341[label="toEnum (Pos wy348)",fontsize=16,color="magenta"];16341 -> 16440[label="",style="dashed", color="magenta", weight=3];
16342 -> 12261[label="",style="dashed", color="red", weight=0];
16342[label="toEnum (Pos wy348)\n  Integral a",fontsize=16,color="magenta"];16342 -> 16441[label="",style="dashed", color="magenta", weight=3];
16343 -> 12262[label="",style="dashed", color="red", weight=0];
16343[label="toEnum (Pos wy348)",fontsize=16,color="magenta"];16343 -> 16442[label="",style="dashed", color="magenta", weight=3];
16344 -> 12263[label="",style="dashed", color="red", weight=0];
16344[label="toEnum (Pos wy348)",fontsize=16,color="magenta"];16344 -> 16443[label="",style="dashed", color="magenta", weight=3];
16345 -> 12264[label="",style="dashed", color="red", weight=0];
16345[label="toEnum (Pos wy348)",fontsize=16,color="magenta"];16345 -> 16444[label="",style="dashed", color="magenta", weight=3];
16346 -> 12265[label="",style="dashed", color="red", weight=0];
16346[label="toEnum (Pos wy348)",fontsize=16,color="magenta"];16346 -> 16445[label="",style="dashed", color="magenta", weight=3];
16347 -> 352[label="",style="dashed", color="red", weight=0];
16347[label="toEnum (Pos wy348)",fontsize=16,color="magenta"];16347 -> 16446[label="",style="dashed", color="magenta", weight=3];
16348 -> 12267[label="",style="dashed", color="red", weight=0];
16348[label="toEnum (Pos wy348)",fontsize=16,color="magenta"];16348 -> 16447[label="",style="dashed", color="magenta", weight=3];
16349 -> 12268[label="",style="dashed", color="red", weight=0];
16349[label="toEnum (Pos wy348)",fontsize=16,color="magenta"];16349 -> 16448[label="",style="dashed", color="magenta", weight=3];
16350[label="map toEnum (takeWhile (flip (>=) (Pos (Succ wy347))) (primPlusInt (Pos Zero) (Pos wy349) : iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos wy349)))))\n  Enum a",fontsize=16,color="black",shape="box"];16350 -> 16449[label="",style="solid", color="black", weight=3];
16351[label="toEnum\n  Enum a",fontsize=16,color="grey",shape="box"];16351 -> 16450[label="",style="dashed", color="grey", weight=3];
8333 -> 5172[label="",style="dashed", color="red", weight=0];
8333[label="primPlusNat (Succ wy1920) wy202",fontsize=16,color="magenta"];8333 -> 8456[label="",style="dashed", color="magenta", weight=3];
8333 -> 8457[label="",style="dashed", color="magenta", weight=3];
8334 -> 5172[label="",style="dashed", color="red", weight=0];
8334[label="primPlusNat (Succ wy1920) wy202",fontsize=16,color="magenta"];8334 -> 8458[label="",style="dashed", color="magenta", weight=3];
8334 -> 8459[label="",style="dashed", color="magenta", weight=3];
8335 -> 5172[label="",style="dashed", color="red", weight=0];
8335[label="primPlusNat (Succ wy1920) wy202",fontsize=16,color="magenta"];8335 -> 8460[label="",style="dashed", color="magenta", weight=3];
8335 -> 8461[label="",style="dashed", color="magenta", weight=3];
12331[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Neg (Succ wy269)) (Pos (Succ wy2670))) (iterate (primPlusInt (Neg (Succ wy269))) (primPlusInt (Neg (Succ wy269)) (primPlusInt (Neg (Succ wy269)) (Pos (Succ wy2670))))) (not (compare (primPlusInt (Neg (Succ wy269)) (Pos (Succ wy2670))) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];12331 -> 12498[label="",style="solid", color="black", weight=3];
12332[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Neg (Succ wy269)) (Pos Zero)) (iterate (primPlusInt (Neg (Succ wy269))) (primPlusInt (Neg (Succ wy269)) (primPlusInt (Neg (Succ wy269)) (Pos Zero)))) (not (primCmpInt (primPlusInt (Neg (Succ wy269)) (Pos Zero)) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];12332 -> 12499[label="",style="solid", color="black", weight=3];
8361 -> 5172[label="",style="dashed", color="red", weight=0];
8361[label="primPlusNat Zero wy205",fontsize=16,color="magenta"];8361 -> 8639[label="",style="dashed", color="magenta", weight=3];
8361 -> 8640[label="",style="dashed", color="magenta", weight=3];
8362 -> 5172[label="",style="dashed", color="red", weight=0];
8362[label="primPlusNat Zero wy205",fontsize=16,color="magenta"];8362 -> 8641[label="",style="dashed", color="magenta", weight=3];
8362 -> 8642[label="",style="dashed", color="magenta", weight=3];
8363 -> 5172[label="",style="dashed", color="red", weight=0];
8363[label="primPlusNat Zero wy205",fontsize=16,color="magenta"];8363 -> 8643[label="",style="dashed", color="magenta", weight=3];
8363 -> 8644[label="",style="dashed", color="magenta", weight=3];
17634[label="map toEnum (takeWhile0 (flip (<=) (Pos (Succ wy401))) (Pos (Succ wy402)) (iterate (primPlusInt (Neg (Succ wy403))) (primPlusInt (Neg (Succ wy403)) (Pos (Succ wy402)))) True)\n  Enum a",fontsize=16,color="black",shape="box"];17634 -> 17741[label="",style="solid", color="black", weight=3];
17635[label="toEnum (Pos (Succ wy402)) : map toEnum (takeWhile (flip (<=) (Pos (Succ wy401))) (iterate (primPlusInt (Neg (Succ wy403))) (primPlusInt (Neg (Succ wy403)) (Pos (Succ wy402)))))\n  Enum a",fontsize=16,color="green",shape="box"];17635 -> 17742[label="",style="dashed", color="green", weight=3];
17635 -> 17743[label="",style="dashed", color="green", weight=3];
16540 -> 12260[label="",style="dashed", color="red", weight=0];
16540[label="toEnum (Neg wy359)",fontsize=16,color="magenta"];16540 -> 16633[label="",style="dashed", color="magenta", weight=3];
16541 -> 12261[label="",style="dashed", color="red", weight=0];
16541[label="toEnum (Neg wy359)\n  Integral a",fontsize=16,color="magenta"];16541 -> 16634[label="",style="dashed", color="magenta", weight=3];
16542 -> 12262[label="",style="dashed", color="red", weight=0];
16542[label="toEnum (Neg wy359)",fontsize=16,color="magenta"];16542 -> 16635[label="",style="dashed", color="magenta", weight=3];
16543 -> 12263[label="",style="dashed", color="red", weight=0];
16543[label="toEnum (Neg wy359)",fontsize=16,color="magenta"];16543 -> 16636[label="",style="dashed", color="magenta", weight=3];
16544 -> 12264[label="",style="dashed", color="red", weight=0];
16544[label="toEnum (Neg wy359)",fontsize=16,color="magenta"];16544 -> 16637[label="",style="dashed", color="magenta", weight=3];
16545 -> 12265[label="",style="dashed", color="red", weight=0];
16545[label="toEnum (Neg wy359)",fontsize=16,color="magenta"];16545 -> 16638[label="",style="dashed", color="magenta", weight=3];
16546 -> 352[label="",style="dashed", color="red", weight=0];
16546[label="toEnum (Neg wy359)",fontsize=16,color="magenta"];16546 -> 16639[label="",style="dashed", color="magenta", weight=3];
16547 -> 12267[label="",style="dashed", color="red", weight=0];
16547[label="toEnum (Neg wy359)",fontsize=16,color="magenta"];16547 -> 16640[label="",style="dashed", color="magenta", weight=3];
16548 -> 12268[label="",style="dashed", color="red", weight=0];
16548[label="toEnum (Neg wy359)",fontsize=16,color="magenta"];16548 -> 16641[label="",style="dashed", color="magenta", weight=3];
16549[label="map toEnum (takeWhile (flip (<=) (Pos (Succ wy306))) (primPlusInt (Neg (Succ wy309)) (Neg wy360) : iterate (primPlusInt (Neg (Succ wy309))) (primPlusInt (Neg (Succ wy309)) (primPlusInt (Neg (Succ wy309)) (Neg wy360)))))\n  Enum a",fontsize=16,color="black",shape="box"];16549 -> 16642[label="",style="solid", color="black", weight=3];
15356[label="Pos Zero",fontsize=16,color="green",shape="box"];12260[label="toEnum wy289",fontsize=16,color="black",shape="triangle"];12260 -> 12517[label="",style="solid", color="black", weight=3];
15357[label="Pos Zero",fontsize=16,color="green",shape="box"];12261[label="toEnum wy289\n  Integral a",fontsize=16,color="black",shape="triangle"];12261 -> 12518[label="",style="solid", color="black", weight=3];
15358[label="Pos Zero",fontsize=16,color="green",shape="box"];12262[label="toEnum wy289",fontsize=16,color="black",shape="triangle"];12262 -> 12519[label="",style="solid", color="black", weight=3];
15359[label="Pos Zero",fontsize=16,color="green",shape="box"];12263[label="toEnum wy289",fontsize=16,color="black",shape="triangle"];12263 -> 12520[label="",style="solid", color="black", weight=3];
15360[label="Pos Zero",fontsize=16,color="green",shape="box"];12264[label="toEnum wy289",fontsize=16,color="black",shape="triangle"];12264 -> 12521[label="",style="solid", color="black", weight=3];
15361[label="Pos Zero",fontsize=16,color="green",shape="box"];12265[label="toEnum wy289",fontsize=16,color="black",shape="triangle"];12265 -> 12522[label="",style="solid", color="black", weight=3];
15362[label="Pos Zero",fontsize=16,color="green",shape="box"];15363[label="Pos Zero",fontsize=16,color="green",shape="box"];12267[label="toEnum wy289",fontsize=16,color="black",shape="triangle"];12267 -> 12524[label="",style="solid", color="black", weight=3];
15364[label="Pos Zero",fontsize=16,color="green",shape="box"];12268[label="toEnum wy289",fontsize=16,color="black",shape="triangle"];12268 -> 12525[label="",style="solid", color="black", weight=3];
15365[label="map toEnum (takeWhile2 (flip (<=) (Pos (Succ wy306))) (primPlusInt (Neg (Succ wy309)) (Pos Zero) : iterate (primPlusInt (Neg (Succ wy309))) (primPlusInt (Neg (Succ wy309)) (primPlusInt (Neg (Succ wy309)) (Pos Zero)))))\n  Enum a",fontsize=16,color="black",shape="box"];15365 -> 15388[label="",style="solid", color="black", weight=3];
8370 -> 5172[label="",style="dashed", color="red", weight=0];
8370[label="primPlusNat (Succ wy1880) wy196",fontsize=16,color="magenta"];8370 -> 8652[label="",style="dashed", color="magenta", weight=3];
8370 -> 8653[label="",style="dashed", color="magenta", weight=3];
8371 -> 5172[label="",style="dashed", color="red", weight=0];
8371[label="primPlusNat (Succ wy1880) wy196",fontsize=16,color="magenta"];8371 -> 8654[label="",style="dashed", color="magenta", weight=3];
8371 -> 8655[label="",style="dashed", color="magenta", weight=3];
8372 -> 5172[label="",style="dashed", color="red", weight=0];
8372[label="primPlusNat (Succ wy1880) wy196",fontsize=16,color="magenta"];8372 -> 8656[label="",style="dashed", color="magenta", weight=3];
8372 -> 8657[label="",style="dashed", color="magenta", weight=3];
12475 -> 6234[label="",style="dashed", color="red", weight=0];
12475[label="map toEnum (takeWhile1 (flip (>=) (Neg wy271)) (primPlusInt (Neg (Succ wy274)) (Pos (Succ wy2720))) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (primPlusInt (Neg (Succ wy274)) (Pos (Succ wy2720))))) (not (primCmpInt (primPlusInt (Neg (Succ wy274)) (Pos (Succ wy2720))) (Neg wy271) == LT)))\n  Enum a",fontsize=16,color="magenta"];12475 -> 12626[label="",style="dashed", color="magenta", weight=3];
12475 -> 12627[label="",style="dashed", color="magenta", weight=3];
12475 -> 12628[label="",style="dashed", color="magenta", weight=3];
18222 -> 12260[label="",style="dashed", color="red", weight=0];
18222[label="toEnum (Neg wy444)",fontsize=16,color="magenta"];18222 -> 18233[label="",style="dashed", color="magenta", weight=3];
18223 -> 12261[label="",style="dashed", color="red", weight=0];
18223[label="toEnum (Neg wy444)\n  Integral a",fontsize=16,color="magenta"];18223 -> 18234[label="",style="dashed", color="magenta", weight=3];
18224 -> 12262[label="",style="dashed", color="red", weight=0];
18224[label="toEnum (Neg wy444)",fontsize=16,color="magenta"];18224 -> 18235[label="",style="dashed", color="magenta", weight=3];
18225 -> 12263[label="",style="dashed", color="red", weight=0];
18225[label="toEnum (Neg wy444)",fontsize=16,color="magenta"];18225 -> 18236[label="",style="dashed", color="magenta", weight=3];
18226 -> 12264[label="",style="dashed", color="red", weight=0];
18226[label="toEnum (Neg wy444)",fontsize=16,color="magenta"];18226 -> 18237[label="",style="dashed", color="magenta", weight=3];
18227 -> 12265[label="",style="dashed", color="red", weight=0];
18227[label="toEnum (Neg wy444)",fontsize=16,color="magenta"];18227 -> 18238[label="",style="dashed", color="magenta", weight=3];
18228 -> 352[label="",style="dashed", color="red", weight=0];
18228[label="toEnum (Neg wy444)",fontsize=16,color="magenta"];18228 -> 18239[label="",style="dashed", color="magenta", weight=3];
18229 -> 12267[label="",style="dashed", color="red", weight=0];
18229[label="toEnum (Neg wy444)",fontsize=16,color="magenta"];18229 -> 18240[label="",style="dashed", color="magenta", weight=3];
18230 -> 12268[label="",style="dashed", color="red", weight=0];
18230[label="toEnum (Neg wy444)",fontsize=16,color="magenta"];18230 -> 18241[label="",style="dashed", color="magenta", weight=3];
18231[label="map toEnum (takeWhile (flip (>=) (Neg (Succ wy443))) (primPlusInt (Neg (Succ wy445)) (Neg wy446) : iterate (primPlusInt (Neg (Succ wy445))) (primPlusInt (Neg (Succ wy445)) (primPlusInt (Neg (Succ wy445)) (Neg wy446)))))\n  Enum a",fontsize=16,color="black",shape="box"];18231 -> 18242[label="",style="solid", color="black", weight=3];
18232[label="toEnum\n  Enum a",fontsize=16,color="grey",shape="box"];18232 -> 18243[label="",style="dashed", color="grey", weight=3];
12496[label="map toEnum (takeWhile1 (flip (>=) (Neg (Succ wy2710))) (primPlusInt (Neg (Succ wy274)) (Pos Zero)) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (primPlusInt (Neg (Succ wy274)) (Pos Zero)))) (not (compare (primPlusInt (Neg (Succ wy274)) (Pos Zero)) (Neg (Succ wy2710)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];12496 -> 12643[label="",style="solid", color="black", weight=3];
12497[label="map toEnum (takeWhile1 (flip (>=) (Neg Zero)) (primPlusInt (Neg (Succ wy274)) (Pos Zero)) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (primPlusInt (Neg (Succ wy274)) (Pos Zero)))) (not (compare (primPlusInt (Neg (Succ wy274)) (Pos Zero)) (Neg Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];12497 -> 12644[label="",style="solid", color="black", weight=3];
8447 -> 5172[label="",style="dashed", color="red", weight=0];
8447[label="primPlusNat Zero wy199",fontsize=16,color="magenta"];8447 -> 8746[label="",style="dashed", color="magenta", weight=3];
8447 -> 8747[label="",style="dashed", color="magenta", weight=3];
8448 -> 5172[label="",style="dashed", color="red", weight=0];
8448[label="primPlusNat Zero wy199",fontsize=16,color="magenta"];8448 -> 8748[label="",style="dashed", color="magenta", weight=3];
8448 -> 8749[label="",style="dashed", color="magenta", weight=3];
8449 -> 5172[label="",style="dashed", color="red", weight=0];
8449[label="primPlusNat Zero wy199",fontsize=16,color="magenta"];8449 -> 8750[label="",style="dashed", color="magenta", weight=3];
8449 -> 8751[label="",style="dashed", color="magenta", weight=3];
16352[label="Pos wy340",fontsize=16,color="green",shape="box"];16353[label="Pos wy340",fontsize=16,color="green",shape="box"];16354[label="Pos wy340",fontsize=16,color="green",shape="box"];16355[label="Pos wy340",fontsize=16,color="green",shape="box"];16356[label="Pos wy340",fontsize=16,color="green",shape="box"];16357[label="Pos wy340",fontsize=16,color="green",shape="box"];16358[label="Pos wy340",fontsize=16,color="green",shape="box"];16359[label="Pos wy340",fontsize=16,color="green",shape="box"];16360[label="Pos wy340",fontsize=16,color="green",shape="box"];16361[label="map toEnum (takeWhile2 (flip (>=) (Pos (Succ wy339))) (primPlusInt (Pos (Succ wy341)) (Pos wy342) : iterate (primPlusInt (Pos (Succ wy341))) (primPlusInt (Pos (Succ wy341)) (primPlusInt (Pos (Succ wy341)) (Pos wy342)))))\n  Enum a",fontsize=16,color="black",shape="box"];16361 -> 16451[label="",style="solid", color="black", weight=3];
16362[label="toEnum wy369\n  Enum a",fontsize=16,color="blue",shape="box"];18996[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];16362 -> 18996[label="",style="solid", color="blue", weight=9];
18996 -> 16452[label="",style="solid", color="blue", weight=3];
18997[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];16362 -> 18997[label="",style="solid", color="blue", weight=9];
18997 -> 16453[label="",style="solid", color="blue", weight=3];
18998[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];16362 -> 18998[label="",style="solid", color="blue", weight=9];
18998 -> 16454[label="",style="solid", color="blue", weight=3];
18999[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];16362 -> 18999[label="",style="solid", color="blue", weight=9];
18999 -> 16455[label="",style="solid", color="blue", weight=3];
19000[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];16362 -> 19000[label="",style="solid", color="blue", weight=9];
19000 -> 16456[label="",style="solid", color="blue", weight=3];
19001[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];16362 -> 19001[label="",style="solid", color="blue", weight=9];
19001 -> 16457[label="",style="solid", color="blue", weight=3];
19002[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];16362 -> 19002[label="",style="solid", color="blue", weight=9];
19002 -> 16458[label="",style="solid", color="blue", weight=3];
19003[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];16362 -> 19003[label="",style="solid", color="blue", weight=9];
19003 -> 16459[label="",style="solid", color="blue", weight=3];
19004[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];16362 -> 19004[label="",style="solid", color="blue", weight=9];
19004 -> 16460[label="",style="solid", color="blue", weight=3];
17887[label="toEnum (Pos (Succ wy423))\n  Enum a",fontsize=16,color="blue",shape="box"];19005[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];17887 -> 19005[label="",style="solid", color="blue", weight=9];
19005 -> 17910[label="",style="solid", color="blue", weight=3];
19006[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];17887 -> 19006[label="",style="solid", color="blue", weight=9];
19006 -> 17911[label="",style="solid", color="blue", weight=3];
19007[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];17887 -> 19007[label="",style="solid", color="blue", weight=9];
19007 -> 17912[label="",style="solid", color="blue", weight=3];
19008[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];17887 -> 19008[label="",style="solid", color="blue", weight=9];
19008 -> 17913[label="",style="solid", color="blue", weight=3];
19009[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];17887 -> 19009[label="",style="solid", color="blue", weight=9];
19009 -> 17914[label="",style="solid", color="blue", weight=3];
19010[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];17887 -> 19010[label="",style="solid", color="blue", weight=9];
19010 -> 17915[label="",style="solid", color="blue", weight=3];
19011[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];17887 -> 19011[label="",style="solid", color="blue", weight=9];
19011 -> 17916[label="",style="solid", color="blue", weight=3];
19012[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];17887 -> 19012[label="",style="solid", color="blue", weight=9];
19012 -> 17917[label="",style="solid", color="blue", weight=3];
19013[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];17887 -> 19013[label="",style="solid", color="blue", weight=9];
19013 -> 17918[label="",style="solid", color="blue", weight=3];
17888[label="map toEnum (takeWhile (flip (>=) (Pos (Succ wy422))) (iterate (primPlusInt (Neg (Succ wy424))) (primPlusInt (Neg (Succ wy424)) (Pos (Succ wy423)))))\n  Enum a",fontsize=16,color="black",shape="box"];17888 -> 17919[label="",style="solid", color="black", weight=3];
17889 -> 14841[label="",style="dashed", color="red", weight=0];
17889[label="map toEnum []\n  Enum a",fontsize=16,color="magenta"];17889 -> 17920[label="",style="dashed", color="magenta", weight=3];
16156[label="wy362",fontsize=16,color="green",shape="box"];16157[label="wy362",fontsize=16,color="green",shape="box"];16158[label="wy362",fontsize=16,color="green",shape="box"];16159[label="wy362",fontsize=16,color="green",shape="box"];16160[label="wy362",fontsize=16,color="green",shape="box"];16161[label="wy362",fontsize=16,color="green",shape="box"];16162[label="wy362",fontsize=16,color="green",shape="box"];16163[label="wy362",fontsize=16,color="green",shape="box"];16164[label="wy362",fontsize=16,color="green",shape="box"];16165 -> 12260[label="",style="dashed", color="red", weight=0];
16165[label="toEnum wy363",fontsize=16,color="magenta"];16165 -> 16247[label="",style="dashed", color="magenta", weight=3];
16166 -> 12261[label="",style="dashed", color="red", weight=0];
16166[label="toEnum wy363\n  Integral a",fontsize=16,color="magenta"];16166 -> 16248[label="",style="dashed", color="magenta", weight=3];
16167 -> 12262[label="",style="dashed", color="red", weight=0];
16167[label="toEnum wy363",fontsize=16,color="magenta"];16167 -> 16249[label="",style="dashed", color="magenta", weight=3];
16168 -> 12263[label="",style="dashed", color="red", weight=0];
16168[label="toEnum wy363",fontsize=16,color="magenta"];16168 -> 16250[label="",style="dashed", color="magenta", weight=3];
16169 -> 12264[label="",style="dashed", color="red", weight=0];
16169[label="toEnum wy363",fontsize=16,color="magenta"];16169 -> 16251[label="",style="dashed", color="magenta", weight=3];
16170 -> 12265[label="",style="dashed", color="red", weight=0];
16170[label="toEnum wy363",fontsize=16,color="magenta"];16170 -> 16252[label="",style="dashed", color="magenta", weight=3];
16171 -> 352[label="",style="dashed", color="red", weight=0];
16171[label="toEnum wy363",fontsize=16,color="magenta"];16171 -> 16253[label="",style="dashed", color="magenta", weight=3];
16172 -> 12267[label="",style="dashed", color="red", weight=0];
16172[label="toEnum wy363",fontsize=16,color="magenta"];16172 -> 16254[label="",style="dashed", color="magenta", weight=3];
16173 -> 12268[label="",style="dashed", color="red", weight=0];
16173[label="toEnum wy363",fontsize=16,color="magenta"];16173 -> 16255[label="",style="dashed", color="magenta", weight=3];
16440[label="Pos wy348",fontsize=16,color="green",shape="box"];16441[label="Pos wy348",fontsize=16,color="green",shape="box"];16442[label="Pos wy348",fontsize=16,color="green",shape="box"];16443[label="Pos wy348",fontsize=16,color="green",shape="box"];16444[label="Pos wy348",fontsize=16,color="green",shape="box"];16445[label="Pos wy348",fontsize=16,color="green",shape="box"];16446[label="Pos wy348",fontsize=16,color="green",shape="box"];16447[label="Pos wy348",fontsize=16,color="green",shape="box"];16448[label="Pos wy348",fontsize=16,color="green",shape="box"];16449[label="map toEnum (takeWhile2 (flip (>=) (Pos (Succ wy347))) (primPlusInt (Pos Zero) (Pos wy349) : iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos wy349)))))\n  Enum a",fontsize=16,color="black",shape="box"];16449 -> 16561[label="",style="solid", color="black", weight=3];
16450[label="toEnum wy370\n  Enum a",fontsize=16,color="blue",shape="box"];19024[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];16450 -> 19024[label="",style="solid", color="blue", weight=9];
19024 -> 16562[label="",style="solid", color="blue", weight=3];
19025[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];16450 -> 19025[label="",style="solid", color="blue", weight=9];
19025 -> 16563[label="",style="solid", color="blue", weight=3];
19026[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];16450 -> 19026[label="",style="solid", color="blue", weight=9];
19026 -> 16564[label="",style="solid", color="blue", weight=3];
19027[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];16450 -> 19027[label="",style="solid", color="blue", weight=9];
19027 -> 16565[label="",style="solid", color="blue", weight=3];
19028[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];16450 -> 19028[label="",style="solid", color="blue", weight=9];
19028 -> 16566[label="",style="solid", color="blue", weight=3];
19029[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];16450 -> 19029[label="",style="solid", color="blue", weight=9];
19029 -> 16567[label="",style="solid", color="blue", weight=3];
19030[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];16450 -> 19030[label="",style="solid", color="blue", weight=9];
19030 -> 16568[label="",style="solid", color="blue", weight=3];
19031[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];16450 -> 19031[label="",style="solid", color="blue", weight=9];
19031 -> 16569[label="",style="solid", color="blue", weight=3];
19032[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];16450 -> 19032[label="",style="solid", color="blue", weight=9];
19032 -> 16570[label="",style="solid", color="blue", weight=3];
8456[label="wy202",fontsize=16,color="green",shape="box"];8457[label="Succ wy1920",fontsize=16,color="green",shape="box"];8458[label="wy202",fontsize=16,color="green",shape="box"];8459[label="Succ wy1920",fontsize=16,color="green",shape="box"];8460[label="wy202",fontsize=16,color="green",shape="box"];8461[label="Succ wy1920",fontsize=16,color="green",shape="box"];12498 -> 6314[label="",style="dashed", color="red", weight=0];
12498[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primPlusInt (Neg (Succ wy269)) (Pos (Succ wy2670))) (iterate (primPlusInt (Neg (Succ wy269))) (primPlusInt (Neg (Succ wy269)) (primPlusInt (Neg (Succ wy269)) (Pos (Succ wy2670))))) (not (primCmpInt (primPlusInt (Neg (Succ wy269)) (Pos (Succ wy2670))) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="magenta"];12498 -> 12645[label="",style="dashed", color="magenta", weight=3];
12498 -> 12646[label="",style="dashed", color="magenta", weight=3];
12499 -> 10944[label="",style="dashed", color="red", weight=0];
12499[label="map toEnum (takeWhile1 (flip (>=) (Pos Zero)) (primMinusNat Zero (Succ wy269)) (iterate (primPlusInt (Neg (Succ wy269))) (primPlusInt (Neg (Succ wy269)) (primMinusNat Zero (Succ wy269)))) (not (primCmpInt (primMinusNat Zero (Succ wy269)) (Pos Zero) == LT)))\n  Enum a",fontsize=16,color="magenta"];12499 -> 12647[label="",style="dashed", color="magenta", weight=3];
12499 -> 12648[label="",style="dashed", color="magenta", weight=3];
8639[label="wy205",fontsize=16,color="green",shape="box"];8640[label="Zero",fontsize=16,color="green",shape="box"];8641[label="wy205",fontsize=16,color="green",shape="box"];8642[label="Zero",fontsize=16,color="green",shape="box"];8643[label="wy205",fontsize=16,color="green",shape="box"];8644[label="Zero",fontsize=16,color="green",shape="box"];17741 -> 14841[label="",style="dashed", color="red", weight=0];
17741[label="map toEnum []\n  Enum a",fontsize=16,color="magenta"];17741 -> 17764[label="",style="dashed", color="magenta", weight=3];
17742[label="toEnum (Pos (Succ wy402))\n  Enum a",fontsize=16,color="blue",shape="box"];19036[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];17742 -> 19036[label="",style="solid", color="blue", weight=9];
19036 -> 17765[label="",style="solid", color="blue", weight=3];
19037[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];17742 -> 19037[label="",style="solid", color="blue", weight=9];
19037 -> 17766[label="",style="solid", color="blue", weight=3];
19038[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];17742 -> 19038[label="",style="solid", color="blue", weight=9];
19038 -> 17767[label="",style="solid", color="blue", weight=3];
19039[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];17742 -> 19039[label="",style="solid", color="blue", weight=9];
19039 -> 17768[label="",style="solid", color="blue", weight=3];
19040[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];17742 -> 19040[label="",style="solid", color="blue", weight=9];
19040 -> 17769[label="",style="solid", color="blue", weight=3];
19041[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];17742 -> 19041[label="",style="solid", color="blue", weight=9];
19041 -> 17770[label="",style="solid", color="blue", weight=3];
19042[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];17742 -> 19042[label="",style="solid", color="blue", weight=9];
19042 -> 17771[label="",style="solid", color="blue", weight=3];
19043[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];17742 -> 19043[label="",style="solid", color="blue", weight=9];
19043 -> 17772[label="",style="solid", color="blue", weight=3];
19044[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];17742 -> 19044[label="",style="solid", color="blue", weight=9];
19044 -> 17773[label="",style="solid", color="blue", weight=3];
17743[label="map toEnum (takeWhile (flip (<=) (Pos (Succ wy401))) (iterate (primPlusInt (Neg (Succ wy403))) (primPlusInt (Neg (Succ wy403)) (Pos (Succ wy402)))))\n  Enum a",fontsize=16,color="black",shape="box"];17743 -> 17774[label="",style="solid", color="black", weight=3];
16633[label="Neg wy359",fontsize=16,color="green",shape="box"];16634[label="Neg wy359",fontsize=16,color="green",shape="box"];16635[label="Neg wy359",fontsize=16,color="green",shape="box"];16636[label="Neg wy359",fontsize=16,color="green",shape="box"];16637[label="Neg wy359",fontsize=16,color="green",shape="box"];16638[label="Neg wy359",fontsize=16,color="green",shape="box"];16639[label="Neg wy359",fontsize=16,color="green",shape="box"];16640[label="Neg wy359",fontsize=16,color="green",shape="box"];16641[label="Neg wy359",fontsize=16,color="green",shape="box"];16642[label="map toEnum (takeWhile2 (flip (<=) (Pos (Succ wy306))) (primPlusInt (Neg (Succ wy309)) (Neg wy360) : iterate (primPlusInt (Neg (Succ wy309))) (primPlusInt (Neg (Succ wy309)) (primPlusInt (Neg (Succ wy309)) (Neg wy360)))))\n  Enum a",fontsize=16,color="black",shape="box"];16642 -> 16712[label="",style="solid", color="black", weight=3];
12517[label="error []",fontsize=16,color="red",shape="box"];12518[label="error []",fontsize=16,color="red",shape="box"];12519[label="error []",fontsize=16,color="red",shape="box"];12520[label="error []",fontsize=16,color="red",shape="box"];12521[label="error []",fontsize=16,color="red",shape="box"];12522[label="error []",fontsize=16,color="red",shape="box"];12524[label="error []",fontsize=16,color="red",shape="box"];12525[label="error []",fontsize=16,color="red",shape="box"];15388[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy306))) (primPlusInt (Neg (Succ wy309)) (Pos Zero)) (iterate (primPlusInt (Neg (Succ wy309))) (primPlusInt (Neg (Succ wy309)) (primPlusInt (Neg (Succ wy309)) (Pos Zero)))) (flip (<=) (Pos (Succ wy306)) (primPlusInt (Neg (Succ wy309)) (Pos Zero))))\n  Enum a",fontsize=16,color="black",shape="box"];15388 -> 15525[label="",style="solid", color="black", weight=3];
8652[label="wy196",fontsize=16,color="green",shape="box"];8653[label="Succ wy1880",fontsize=16,color="green",shape="box"];8654[label="wy196",fontsize=16,color="green",shape="box"];8655[label="Succ wy1880",fontsize=16,color="green",shape="box"];8656[label="wy196",fontsize=16,color="green",shape="box"];8657[label="Succ wy1880",fontsize=16,color="green",shape="box"];12626[label="wy271",fontsize=16,color="green",shape="box"];12627[label="wy274",fontsize=16,color="green",shape="box"];12628[label="wy2720",fontsize=16,color="green",shape="box"];18233[label="Neg wy444",fontsize=16,color="green",shape="box"];18234[label="Neg wy444",fontsize=16,color="green",shape="box"];18235[label="Neg wy444",fontsize=16,color="green",shape="box"];18236[label="Neg wy444",fontsize=16,color="green",shape="box"];18237[label="Neg wy444",fontsize=16,color="green",shape="box"];18238[label="Neg wy444",fontsize=16,color="green",shape="box"];18239[label="Neg wy444",fontsize=16,color="green",shape="box"];18240[label="Neg wy444",fontsize=16,color="green",shape="box"];18241[label="Neg wy444",fontsize=16,color="green",shape="box"];18242[label="map toEnum (takeWhile2 (flip (>=) (Neg (Succ wy443))) (primPlusInt (Neg (Succ wy445)) (Neg wy446) : iterate (primPlusInt (Neg (Succ wy445))) (primPlusInt (Neg (Succ wy445)) (primPlusInt (Neg (Succ wy445)) (Neg wy446)))))\n  Enum a",fontsize=16,color="black",shape="box"];18242 -> 18244[label="",style="solid", color="black", weight=3];
18243[label="toEnum wy449\n  Enum a",fontsize=16,color="blue",shape="box"];19045[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];18243 -> 19045[label="",style="solid", color="blue", weight=9];
19045 -> 18245[label="",style="solid", color="blue", weight=3];
19046[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];18243 -> 19046[label="",style="solid", color="blue", weight=9];
19046 -> 18246[label="",style="solid", color="blue", weight=3];
19047[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];18243 -> 19047[label="",style="solid", color="blue", weight=9];
19047 -> 18247[label="",style="solid", color="blue", weight=3];
19048[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];18243 -> 19048[label="",style="solid", color="blue", weight=9];
19048 -> 18248[label="",style="solid", color="blue", weight=3];
19049[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];18243 -> 19049[label="",style="solid", color="blue", weight=9];
19049 -> 18249[label="",style="solid", color="blue", weight=3];
19050[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];18243 -> 19050[label="",style="solid", color="blue", weight=9];
19050 -> 18250[label="",style="solid", color="blue", weight=3];
19051[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];18243 -> 19051[label="",style="solid", color="blue", weight=9];
19051 -> 18251[label="",style="solid", color="blue", weight=3];
19052[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];18243 -> 19052[label="",style="solid", color="blue", weight=9];
19052 -> 18252[label="",style="solid", color="blue", weight=3];
19053[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];18243 -> 19053[label="",style="solid", color="blue", weight=9];
19053 -> 18253[label="",style="solid", color="blue", weight=3];
12643[label="map toEnum (takeWhile1 (flip (>=) (Neg (Succ wy2710))) (primPlusInt (Neg (Succ wy274)) (Pos Zero)) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (primPlusInt (Neg (Succ wy274)) (Pos Zero)))) (not (primCmpInt (primPlusInt (Neg (Succ wy274)) (Pos Zero)) (Neg (Succ wy2710)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];12643 -> 12852[label="",style="solid", color="black", weight=3];
12644[label="map toEnum (takeWhile1 (flip (>=) (Neg Zero)) (primPlusInt (Neg (Succ wy274)) (Pos Zero)) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (primPlusInt (Neg (Succ wy274)) (Pos Zero)))) (not (primCmpInt (primPlusInt (Neg (Succ wy274)) (Pos Zero)) (Neg Zero) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];12644 -> 12853[label="",style="solid", color="black", weight=3];
8746[label="wy199",fontsize=16,color="green",shape="box"];8747[label="Zero",fontsize=16,color="green",shape="box"];8748[label="wy199",fontsize=16,color="green",shape="box"];8749[label="Zero",fontsize=16,color="green",shape="box"];8750[label="wy199",fontsize=16,color="green",shape="box"];8751[label="Zero",fontsize=16,color="green",shape="box"];16451[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy339))) (primPlusInt (Pos (Succ wy341)) (Pos wy342)) (iterate (primPlusInt (Pos (Succ wy341))) (primPlusInt (Pos (Succ wy341)) (primPlusInt (Pos (Succ wy341)) (Pos wy342)))) (flip (>=) (Pos (Succ wy339)) (primPlusInt (Pos (Succ wy341)) (Pos wy342))))\n  Enum a",fontsize=16,color="black",shape="box"];16451 -> 16571[label="",style="solid", color="black", weight=3];
16452 -> 12260[label="",style="dashed", color="red", weight=0];
16452[label="toEnum wy369",fontsize=16,color="magenta"];16452 -> 16572[label="",style="dashed", color="magenta", weight=3];
16453 -> 12261[label="",style="dashed", color="red", weight=0];
16453[label="toEnum wy369\n  Integral a",fontsize=16,color="magenta"];16453 -> 16573[label="",style="dashed", color="magenta", weight=3];
16454 -> 12262[label="",style="dashed", color="red", weight=0];
16454[label="toEnum wy369",fontsize=16,color="magenta"];16454 -> 16574[label="",style="dashed", color="magenta", weight=3];
16455 -> 12263[label="",style="dashed", color="red", weight=0];
16455[label="toEnum wy369",fontsize=16,color="magenta"];16455 -> 16575[label="",style="dashed", color="magenta", weight=3];
16456 -> 12264[label="",style="dashed", color="red", weight=0];
16456[label="toEnum wy369",fontsize=16,color="magenta"];16456 -> 16576[label="",style="dashed", color="magenta", weight=3];
16457 -> 12265[label="",style="dashed", color="red", weight=0];
16457[label="toEnum wy369",fontsize=16,color="magenta"];16457 -> 16577[label="",style="dashed", color="magenta", weight=3];
16458 -> 352[label="",style="dashed", color="red", weight=0];
16458[label="toEnum wy369",fontsize=16,color="magenta"];16458 -> 16578[label="",style="dashed", color="magenta", weight=3];
16459 -> 12267[label="",style="dashed", color="red", weight=0];
16459[label="toEnum wy369",fontsize=16,color="magenta"];16459 -> 16579[label="",style="dashed", color="magenta", weight=3];
16460 -> 12268[label="",style="dashed", color="red", weight=0];
16460[label="toEnum wy369",fontsize=16,color="magenta"];16460 -> 16580[label="",style="dashed", color="magenta", weight=3];
17910 -> 12260[label="",style="dashed", color="red", weight=0];
17910[label="toEnum (Pos (Succ wy423))",fontsize=16,color="magenta"];17910 -> 17945[label="",style="dashed", color="magenta", weight=3];
17911 -> 12261[label="",style="dashed", color="red", weight=0];
17911[label="toEnum (Pos (Succ wy423))\n  Integral a",fontsize=16,color="magenta"];17911 -> 17946[label="",style="dashed", color="magenta", weight=3];
17912 -> 12262[label="",style="dashed", color="red", weight=0];
17912[label="toEnum (Pos (Succ wy423))",fontsize=16,color="magenta"];17912 -> 17947[label="",style="dashed", color="magenta", weight=3];
17913 -> 12263[label="",style="dashed", color="red", weight=0];
17913[label="toEnum (Pos (Succ wy423))",fontsize=16,color="magenta"];17913 -> 17948[label="",style="dashed", color="magenta", weight=3];
17914 -> 12264[label="",style="dashed", color="red", weight=0];
17914[label="toEnum (Pos (Succ wy423))",fontsize=16,color="magenta"];17914 -> 17949[label="",style="dashed", color="magenta", weight=3];
17915 -> 12265[label="",style="dashed", color="red", weight=0];
17915[label="toEnum (Pos (Succ wy423))",fontsize=16,color="magenta"];17915 -> 17950[label="",style="dashed", color="magenta", weight=3];
17916 -> 352[label="",style="dashed", color="red", weight=0];
17916[label="toEnum (Pos (Succ wy423))",fontsize=16,color="magenta"];17916 -> 17951[label="",style="dashed", color="magenta", weight=3];
17917 -> 12267[label="",style="dashed", color="red", weight=0];
17917[label="toEnum (Pos (Succ wy423))",fontsize=16,color="magenta"];17917 -> 17952[label="",style="dashed", color="magenta", weight=3];
17918 -> 12268[label="",style="dashed", color="red", weight=0];
17918[label="toEnum (Pos (Succ wy423))",fontsize=16,color="magenta"];17918 -> 17953[label="",style="dashed", color="magenta", weight=3];
17919[label="map toEnum (takeWhile (flip (>=) (Pos (Succ wy422))) (primPlusInt (Neg (Succ wy424)) (Pos (Succ wy423)) : iterate (primPlusInt (Neg (Succ wy424))) (primPlusInt (Neg (Succ wy424)) (primPlusInt (Neg (Succ wy424)) (Pos (Succ wy423))))))\n  Enum a",fontsize=16,color="black",shape="box"];17919 -> 17954[label="",style="solid", color="black", weight=3];
17920[label="toEnum\n  Enum a",fontsize=16,color="grey",shape="box"];17920 -> 17955[label="",style="dashed", color="grey", weight=3];
16247[label="wy363",fontsize=16,color="green",shape="box"];16248[label="wy363",fontsize=16,color="green",shape="box"];16249[label="wy363",fontsize=16,color="green",shape="box"];16250[label="wy363",fontsize=16,color="green",shape="box"];16251[label="wy363",fontsize=16,color="green",shape="box"];16252[label="wy363",fontsize=16,color="green",shape="box"];16253[label="wy363",fontsize=16,color="green",shape="box"];16254[label="wy363",fontsize=16,color="green",shape="box"];16255[label="wy363",fontsize=16,color="green",shape="box"];16561[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy347))) (primPlusInt (Pos Zero) (Pos wy349)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos wy349)))) (flip (>=) (Pos (Succ wy347)) (primPlusInt (Pos Zero) (Pos wy349))))\n  Enum a",fontsize=16,color="black",shape="box"];16561 -> 16653[label="",style="solid", color="black", weight=3];
16562 -> 12260[label="",style="dashed", color="red", weight=0];
16562[label="toEnum wy370",fontsize=16,color="magenta"];16562 -> 16654[label="",style="dashed", color="magenta", weight=3];
16563 -> 12261[label="",style="dashed", color="red", weight=0];
16563[label="toEnum wy370\n  Integral a",fontsize=16,color="magenta"];16563 -> 16655[label="",style="dashed", color="magenta", weight=3];
16564 -> 12262[label="",style="dashed", color="red", weight=0];
16564[label="toEnum wy370",fontsize=16,color="magenta"];16564 -> 16656[label="",style="dashed", color="magenta", weight=3];
16565 -> 12263[label="",style="dashed", color="red", weight=0];
16565[label="toEnum wy370",fontsize=16,color="magenta"];16565 -> 16657[label="",style="dashed", color="magenta", weight=3];
16566 -> 12264[label="",style="dashed", color="red", weight=0];
16566[label="toEnum wy370",fontsize=16,color="magenta"];16566 -> 16658[label="",style="dashed", color="magenta", weight=3];
16567 -> 12265[label="",style="dashed", color="red", weight=0];
16567[label="toEnum wy370",fontsize=16,color="magenta"];16567 -> 16659[label="",style="dashed", color="magenta", weight=3];
16568 -> 352[label="",style="dashed", color="red", weight=0];
16568[label="toEnum wy370",fontsize=16,color="magenta"];16568 -> 16660[label="",style="dashed", color="magenta", weight=3];
16569 -> 12267[label="",style="dashed", color="red", weight=0];
16569[label="toEnum wy370",fontsize=16,color="magenta"];16569 -> 16661[label="",style="dashed", color="magenta", weight=3];
16570 -> 12268[label="",style="dashed", color="red", weight=0];
16570[label="toEnum wy370",fontsize=16,color="magenta"];16570 -> 16662[label="",style="dashed", color="magenta", weight=3];
12645[label="wy2670",fontsize=16,color="green",shape="box"];12646[label="wy269",fontsize=16,color="green",shape="box"];12647[label="Zero",fontsize=16,color="green",shape="box"];12648[label="Succ wy269",fontsize=16,color="green",shape="box"];17764[label="toEnum\n  Enum a",fontsize=16,color="grey",shape="box"];17764 -> 17787[label="",style="dashed", color="grey", weight=3];
17765 -> 12260[label="",style="dashed", color="red", weight=0];
17765[label="toEnum (Pos (Succ wy402))",fontsize=16,color="magenta"];17765 -> 17788[label="",style="dashed", color="magenta", weight=3];
17766 -> 12261[label="",style="dashed", color="red", weight=0];
17766[label="toEnum (Pos (Succ wy402))\n  Integral a",fontsize=16,color="magenta"];17766 -> 17789[label="",style="dashed", color="magenta", weight=3];
17767 -> 12262[label="",style="dashed", color="red", weight=0];
17767[label="toEnum (Pos (Succ wy402))",fontsize=16,color="magenta"];17767 -> 17790[label="",style="dashed", color="magenta", weight=3];
17768 -> 12263[label="",style="dashed", color="red", weight=0];
17768[label="toEnum (Pos (Succ wy402))",fontsize=16,color="magenta"];17768 -> 17791[label="",style="dashed", color="magenta", weight=3];
17769 -> 12264[label="",style="dashed", color="red", weight=0];
17769[label="toEnum (Pos (Succ wy402))",fontsize=16,color="magenta"];17769 -> 17792[label="",style="dashed", color="magenta", weight=3];
17770 -> 12265[label="",style="dashed", color="red", weight=0];
17770[label="toEnum (Pos (Succ wy402))",fontsize=16,color="magenta"];17770 -> 17793[label="",style="dashed", color="magenta", weight=3];
17771 -> 352[label="",style="dashed", color="red", weight=0];
17771[label="toEnum (Pos (Succ wy402))",fontsize=16,color="magenta"];17771 -> 17794[label="",style="dashed", color="magenta", weight=3];
17772 -> 12267[label="",style="dashed", color="red", weight=0];
17772[label="toEnum (Pos (Succ wy402))",fontsize=16,color="magenta"];17772 -> 17795[label="",style="dashed", color="magenta", weight=3];
17773 -> 12268[label="",style="dashed", color="red", weight=0];
17773[label="toEnum (Pos (Succ wy402))",fontsize=16,color="magenta"];17773 -> 17796[label="",style="dashed", color="magenta", weight=3];
17774[label="map toEnum (takeWhile (flip (<=) (Pos (Succ wy401))) (primPlusInt (Neg (Succ wy403)) (Pos (Succ wy402)) : iterate (primPlusInt (Neg (Succ wy403))) (primPlusInt (Neg (Succ wy403)) (primPlusInt (Neg (Succ wy403)) (Pos (Succ wy402))))))\n  Enum a",fontsize=16,color="black",shape="box"];17774 -> 17797[label="",style="solid", color="black", weight=3];
16712[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy306))) (primPlusInt (Neg (Succ wy309)) (Neg wy360)) (iterate (primPlusInt (Neg (Succ wy309))) (primPlusInt (Neg (Succ wy309)) (primPlusInt (Neg (Succ wy309)) (Neg wy360)))) (flip (<=) (Pos (Succ wy306)) (primPlusInt (Neg (Succ wy309)) (Neg wy360))))\n  Enum a",fontsize=16,color="black",shape="box"];16712 -> 16796[label="",style="solid", color="black", weight=3];
15525[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy306))) (primPlusInt (Neg (Succ wy309)) (Pos Zero)) (iterate (primPlusInt (Neg (Succ wy309))) (primPlusInt (Neg (Succ wy309)) (primPlusInt (Neg (Succ wy309)) (Pos Zero)))) ((<=) primPlusInt (Neg (Succ wy309)) (Pos Zero) Pos (Succ wy306)))\n  Enum a",fontsize=16,color="black",shape="box"];15525 -> 15672[label="",style="solid", color="black", weight=3];
18244[label="map toEnum (takeWhile1 (flip (>=) (Neg (Succ wy443))) (primPlusInt (Neg (Succ wy445)) (Neg wy446)) (iterate (primPlusInt (Neg (Succ wy445))) (primPlusInt (Neg (Succ wy445)) (primPlusInt (Neg (Succ wy445)) (Neg wy446)))) (flip (>=) (Neg (Succ wy443)) (primPlusInt (Neg (Succ wy445)) (Neg wy446))))\n  Enum a",fontsize=16,color="black",shape="box"];18244 -> 18254[label="",style="solid", color="black", weight=3];
18245 -> 12260[label="",style="dashed", color="red", weight=0];
18245[label="toEnum wy449",fontsize=16,color="magenta"];18245 -> 18255[label="",style="dashed", color="magenta", weight=3];
18246 -> 12261[label="",style="dashed", color="red", weight=0];
18246[label="toEnum wy449\n  Integral a",fontsize=16,color="magenta"];18246 -> 18256[label="",style="dashed", color="magenta", weight=3];
18247 -> 12262[label="",style="dashed", color="red", weight=0];
18247[label="toEnum wy449",fontsize=16,color="magenta"];18247 -> 18257[label="",style="dashed", color="magenta", weight=3];
18248 -> 12263[label="",style="dashed", color="red", weight=0];
18248[label="toEnum wy449",fontsize=16,color="magenta"];18248 -> 18258[label="",style="dashed", color="magenta", weight=3];
18249 -> 12264[label="",style="dashed", color="red", weight=0];
18249[label="toEnum wy449",fontsize=16,color="magenta"];18249 -> 18259[label="",style="dashed", color="magenta", weight=3];
18250 -> 12265[label="",style="dashed", color="red", weight=0];
18250[label="toEnum wy449",fontsize=16,color="magenta"];18250 -> 18260[label="",style="dashed", color="magenta", weight=3];
18251 -> 352[label="",style="dashed", color="red", weight=0];
18251[label="toEnum wy449",fontsize=16,color="magenta"];18251 -> 18261[label="",style="dashed", color="magenta", weight=3];
18252 -> 12267[label="",style="dashed", color="red", weight=0];
18252[label="toEnum wy449",fontsize=16,color="magenta"];18252 -> 18262[label="",style="dashed", color="magenta", weight=3];
18253 -> 12268[label="",style="dashed", color="red", weight=0];
18253[label="toEnum wy449",fontsize=16,color="magenta"];18253 -> 18263[label="",style="dashed", color="magenta", weight=3];
12852 -> 11139[label="",style="dashed", color="red", weight=0];
12852[label="map toEnum (takeWhile1 (flip (>=) (Neg (Succ wy2710))) (primMinusNat Zero (Succ wy274)) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (primMinusNat Zero (Succ wy274)))) (not (primCmpInt (primMinusNat Zero (Succ wy274)) (Neg (Succ wy2710)) == LT)))\n  Enum a",fontsize=16,color="magenta"];12852 -> 13095[label="",style="dashed", color="magenta", weight=3];
12852 -> 13096[label="",style="dashed", color="magenta", weight=3];
12852 -> 13097[label="",style="dashed", color="magenta", weight=3];
12853 -> 11139[label="",style="dashed", color="red", weight=0];
12853[label="map toEnum (takeWhile1 (flip (>=) (Neg Zero)) (primMinusNat Zero (Succ wy274)) (iterate (primPlusInt (Neg (Succ wy274))) (primPlusInt (Neg (Succ wy274)) (primMinusNat Zero (Succ wy274)))) (not (primCmpInt (primMinusNat Zero (Succ wy274)) (Neg Zero) == LT)))\n  Enum a",fontsize=16,color="magenta"];12853 -> 13098[label="",style="dashed", color="magenta", weight=3];
12853 -> 13099[label="",style="dashed", color="magenta", weight=3];
12853 -> 13100[label="",style="dashed", color="magenta", weight=3];
16571[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy339))) (primPlusInt (Pos (Succ wy341)) (Pos wy342)) (iterate (primPlusInt (Pos (Succ wy341))) (primPlusInt (Pos (Succ wy341)) (primPlusInt (Pos (Succ wy341)) (Pos wy342)))) ((>=) primPlusInt (Pos (Succ wy341)) (Pos wy342) Pos (Succ wy339)))\n  Enum a",fontsize=16,color="black",shape="box"];16571 -> 16663[label="",style="solid", color="black", weight=3];
16572[label="wy369",fontsize=16,color="green",shape="box"];16573[label="wy369",fontsize=16,color="green",shape="box"];16574[label="wy369",fontsize=16,color="green",shape="box"];16575[label="wy369",fontsize=16,color="green",shape="box"];16576[label="wy369",fontsize=16,color="green",shape="box"];16577[label="wy369",fontsize=16,color="green",shape="box"];16578[label="wy369",fontsize=16,color="green",shape="box"];16579[label="wy369",fontsize=16,color="green",shape="box"];16580[label="wy369",fontsize=16,color="green",shape="box"];17945[label="Pos (Succ wy423)",fontsize=16,color="green",shape="box"];17946[label="Pos (Succ wy423)",fontsize=16,color="green",shape="box"];17947[label="Pos (Succ wy423)",fontsize=16,color="green",shape="box"];17948[label="Pos (Succ wy423)",fontsize=16,color="green",shape="box"];17949[label="Pos (Succ wy423)",fontsize=16,color="green",shape="box"];17950[label="Pos (Succ wy423)",fontsize=16,color="green",shape="box"];17951[label="Pos (Succ wy423)",fontsize=16,color="green",shape="box"];17952[label="Pos (Succ wy423)",fontsize=16,color="green",shape="box"];17953[label="Pos (Succ wy423)",fontsize=16,color="green",shape="box"];17954[label="map toEnum (takeWhile2 (flip (>=) (Pos (Succ wy422))) (primPlusInt (Neg (Succ wy424)) (Pos (Succ wy423)) : iterate (primPlusInt (Neg (Succ wy424))) (primPlusInt (Neg (Succ wy424)) (primPlusInt (Neg (Succ wy424)) (Pos (Succ wy423))))))\n  Enum a",fontsize=16,color="black",shape="box"];17954 -> 17985[label="",style="solid", color="black", weight=3];
17955[label="toEnum wy430\n  Enum a",fontsize=16,color="blue",shape="box"];19101[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];17955 -> 19101[label="",style="solid", color="blue", weight=9];
19101 -> 17986[label="",style="solid", color="blue", weight=3];
19102[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];17955 -> 19102[label="",style="solid", color="blue", weight=9];
19102 -> 17987[label="",style="solid", color="blue", weight=3];
19103[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];17955 -> 19103[label="",style="solid", color="blue", weight=9];
19103 -> 17988[label="",style="solid", color="blue", weight=3];
19104[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];17955 -> 19104[label="",style="solid", color="blue", weight=9];
19104 -> 17989[label="",style="solid", color="blue", weight=3];
19105[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];17955 -> 19105[label="",style="solid", color="blue", weight=9];
19105 -> 17990[label="",style="solid", color="blue", weight=3];
19106[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];17955 -> 19106[label="",style="solid", color="blue", weight=9];
19106 -> 17991[label="",style="solid", color="blue", weight=3];
19107[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];17955 -> 19107[label="",style="solid", color="blue", weight=9];
19107 -> 17992[label="",style="solid", color="blue", weight=3];
19108[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];17955 -> 19108[label="",style="solid", color="blue", weight=9];
19108 -> 17993[label="",style="solid", color="blue", weight=3];
19109[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];17955 -> 19109[label="",style="solid", color="blue", weight=9];
19109 -> 17994[label="",style="solid", color="blue", weight=3];
16653[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy347))) (primPlusInt (Pos Zero) (Pos wy349)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos wy349)))) ((>=) primPlusInt (Pos Zero) (Pos wy349) Pos (Succ wy347)))\n  Enum a",fontsize=16,color="black",shape="box"];16653 -> 16723[label="",style="solid", color="black", weight=3];
16654[label="wy370",fontsize=16,color="green",shape="box"];16655[label="wy370",fontsize=16,color="green",shape="box"];16656[label="wy370",fontsize=16,color="green",shape="box"];16657[label="wy370",fontsize=16,color="green",shape="box"];16658[label="wy370",fontsize=16,color="green",shape="box"];16659[label="wy370",fontsize=16,color="green",shape="box"];16660[label="wy370",fontsize=16,color="green",shape="box"];16661[label="wy370",fontsize=16,color="green",shape="box"];16662[label="wy370",fontsize=16,color="green",shape="box"];17787[label="toEnum wy427\n  Enum a",fontsize=16,color="blue",shape="box"];19110[label="toEnum :: Int -> ()",fontsize=10,color="white",style="solid",shape="box"];17787 -> 19110[label="",style="solid", color="blue", weight=9];
19110 -> 17810[label="",style="solid", color="blue", weight=3];
19111[label="toEnum :: Int -> Ratio a",fontsize=10,color="white",style="solid",shape="box"];17787 -> 19111[label="",style="solid", color="blue", weight=9];
19111 -> 17811[label="",style="solid", color="blue", weight=3];
19112[label="toEnum :: Int -> Float",fontsize=10,color="white",style="solid",shape="box"];17787 -> 19112[label="",style="solid", color="blue", weight=9];
19112 -> 17812[label="",style="solid", color="blue", weight=3];
19113[label="toEnum :: Int -> Ordering",fontsize=10,color="white",style="solid",shape="box"];17787 -> 19113[label="",style="solid", color="blue", weight=9];
19113 -> 17813[label="",style="solid", color="blue", weight=3];
19114[label="toEnum :: Int -> Integer",fontsize=10,color="white",style="solid",shape="box"];17787 -> 19114[label="",style="solid", color="blue", weight=9];
19114 -> 17814[label="",style="solid", color="blue", weight=3];
19115[label="toEnum :: Int -> Bool",fontsize=10,color="white",style="solid",shape="box"];17787 -> 19115[label="",style="solid", color="blue", weight=9];
19115 -> 17815[label="",style="solid", color="blue", weight=3];
19116[label="toEnum :: Int -> Char",fontsize=10,color="white",style="solid",shape="box"];17787 -> 19116[label="",style="solid", color="blue", weight=9];
19116 -> 17816[label="",style="solid", color="blue", weight=3];
19117[label="toEnum :: Int -> Int",fontsize=10,color="white",style="solid",shape="box"];17787 -> 19117[label="",style="solid", color="blue", weight=9];
19117 -> 17817[label="",style="solid", color="blue", weight=3];
19118[label="toEnum :: Int -> Double",fontsize=10,color="white",style="solid",shape="box"];17787 -> 19118[label="",style="solid", color="blue", weight=9];
19118 -> 17818[label="",style="solid", color="blue", weight=3];
17788[label="Pos (Succ wy402)",fontsize=16,color="green",shape="box"];17789[label="Pos (Succ wy402)",fontsize=16,color="green",shape="box"];17790[label="Pos (Succ wy402)",fontsize=16,color="green",shape="box"];17791[label="Pos (Succ wy402)",fontsize=16,color="green",shape="box"];17792[label="Pos (Succ wy402)",fontsize=16,color="green",shape="box"];17793[label="Pos (Succ wy402)",fontsize=16,color="green",shape="box"];17794[label="Pos (Succ wy402)",fontsize=16,color="green",shape="box"];17795[label="Pos (Succ wy402)",fontsize=16,color="green",shape="box"];17796[label="Pos (Succ wy402)",fontsize=16,color="green",shape="box"];17797[label="map toEnum (takeWhile2 (flip (<=) (Pos (Succ wy401))) (primPlusInt (Neg (Succ wy403)) (Pos (Succ wy402)) : iterate (primPlusInt (Neg (Succ wy403))) (primPlusInt (Neg (Succ wy403)) (primPlusInt (Neg (Succ wy403)) (Pos (Succ wy402))))))\n  Enum a",fontsize=16,color="black",shape="box"];17797 -> 17819[label="",style="solid", color="black", weight=3];
16796[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy306))) (primPlusInt (Neg (Succ wy309)) (Neg wy360)) (iterate (primPlusInt (Neg (Succ wy309))) (primPlusInt (Neg (Succ wy309)) (primPlusInt (Neg (Succ wy309)) (Neg wy360)))) ((<=) primPlusInt (Neg (Succ wy309)) (Neg wy360) Pos (Succ wy306)))\n  Enum a",fontsize=16,color="black",shape="box"];16796 -> 16866[label="",style="solid", color="black", weight=3];
15672[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy306))) (primPlusInt (Neg (Succ wy309)) (Pos Zero)) (iterate (primPlusInt (Neg (Succ wy309))) (primPlusInt (Neg (Succ wy309)) (primPlusInt (Neg (Succ wy309)) (Pos Zero)))) (compare (primPlusInt (Neg (Succ wy309)) (Pos Zero)) (Pos (Succ wy306)) /= GT))\n  Enum a",fontsize=16,color="black",shape="box"];15672 -> 15840[label="",style="solid", color="black", weight=3];
18254[label="map toEnum (takeWhile1 (flip (>=) (Neg (Succ wy443))) (primPlusInt (Neg (Succ wy445)) (Neg wy446)) (iterate (primPlusInt (Neg (Succ wy445))) (primPlusInt (Neg (Succ wy445)) (primPlusInt (Neg (Succ wy445)) (Neg wy446)))) ((>=) primPlusInt (Neg (Succ wy445)) (Neg wy446) Neg (Succ wy443)))\n  Enum a",fontsize=16,color="black",shape="box"];18254 -> 18264[label="",style="solid", color="black", weight=3];
18255[label="wy449",fontsize=16,color="green",shape="box"];18256[label="wy449",fontsize=16,color="green",shape="box"];18257[label="wy449",fontsize=16,color="green",shape="box"];18258[label="wy449",fontsize=16,color="green",shape="box"];18259[label="wy449",fontsize=16,color="green",shape="box"];18260[label="wy449",fontsize=16,color="green",shape="box"];18261[label="wy449",fontsize=16,color="green",shape="box"];18262[label="wy449",fontsize=16,color="green",shape="box"];18263[label="wy449",fontsize=16,color="green",shape="box"];13095[label="Zero",fontsize=16,color="green",shape="box"];13096[label="Succ wy2710",fontsize=16,color="green",shape="box"];13097[label="Succ wy274",fontsize=16,color="green",shape="box"];13098[label="Zero",fontsize=16,color="green",shape="box"];13099[label="Zero",fontsize=16,color="green",shape="box"];13100[label="Succ wy274",fontsize=16,color="green",shape="box"];16663[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy339))) (primPlusInt (Pos (Succ wy341)) (Pos wy342)) (iterate (primPlusInt (Pos (Succ wy341))) (primPlusInt (Pos (Succ wy341)) (primPlusInt (Pos (Succ wy341)) (Pos wy342)))) (compare (primPlusInt (Pos (Succ wy341)) (Pos wy342)) (Pos (Succ wy339)) /= LT))\n  Enum a",fontsize=16,color="black",shape="box"];16663 -> 16724[label="",style="solid", color="black", weight=3];
17985[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy422))) (primPlusInt (Neg (Succ wy424)) (Pos (Succ wy423))) (iterate (primPlusInt (Neg (Succ wy424))) (primPlusInt (Neg (Succ wy424)) (primPlusInt (Neg (Succ wy424)) (Pos (Succ wy423))))) (flip (>=) (Pos (Succ wy422)) (primPlusInt (Neg (Succ wy424)) (Pos (Succ wy423)))))\n  Enum a",fontsize=16,color="black",shape="box"];17985 -> 18001[label="",style="solid", color="black", weight=3];
17986 -> 12260[label="",style="dashed", color="red", weight=0];
17986[label="toEnum wy430",fontsize=16,color="magenta"];17986 -> 18002[label="",style="dashed", color="magenta", weight=3];
17987 -> 12261[label="",style="dashed", color="red", weight=0];
17987[label="toEnum wy430\n  Integral a",fontsize=16,color="magenta"];17987 -> 18003[label="",style="dashed", color="magenta", weight=3];
17988 -> 12262[label="",style="dashed", color="red", weight=0];
17988[label="toEnum wy430",fontsize=16,color="magenta"];17988 -> 18004[label="",style="dashed", color="magenta", weight=3];
17989 -> 12263[label="",style="dashed", color="red", weight=0];
17989[label="toEnum wy430",fontsize=16,color="magenta"];17989 -> 18005[label="",style="dashed", color="magenta", weight=3];
17990 -> 12264[label="",style="dashed", color="red", weight=0];
17990[label="toEnum wy430",fontsize=16,color="magenta"];17990 -> 18006[label="",style="dashed", color="magenta", weight=3];
17991 -> 12265[label="",style="dashed", color="red", weight=0];
17991[label="toEnum wy430",fontsize=16,color="magenta"];17991 -> 18007[label="",style="dashed", color="magenta", weight=3];
17992 -> 352[label="",style="dashed", color="red", weight=0];
17992[label="toEnum wy430",fontsize=16,color="magenta"];17992 -> 18008[label="",style="dashed", color="magenta", weight=3];
17993 -> 12267[label="",style="dashed", color="red", weight=0];
17993[label="toEnum wy430",fontsize=16,color="magenta"];17993 -> 18009[label="",style="dashed", color="magenta", weight=3];
17994 -> 12268[label="",style="dashed", color="red", weight=0];
17994[label="toEnum wy430",fontsize=16,color="magenta"];17994 -> 18010[label="",style="dashed", color="magenta", weight=3];
16723[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy347))) (primPlusInt (Pos Zero) (Pos wy349)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos wy349)))) (compare (primPlusInt (Pos Zero) (Pos wy349)) (Pos (Succ wy347)) /= LT))\n  Enum a",fontsize=16,color="black",shape="box"];16723 -> 16798[label="",style="solid", color="black", weight=3];
17810 -> 12260[label="",style="dashed", color="red", weight=0];
17810[label="toEnum wy427",fontsize=16,color="magenta"];17810 -> 17830[label="",style="dashed", color="magenta", weight=3];
17811 -> 12261[label="",style="dashed", color="red", weight=0];
17811[label="toEnum wy427\n  Integral a",fontsize=16,color="magenta"];17811 -> 17831[label="",style="dashed", color="magenta", weight=3];
17812 -> 12262[label="",style="dashed", color="red", weight=0];
17812[label="toEnum wy427",fontsize=16,color="magenta"];17812 -> 17832[label="",style="dashed", color="magenta", weight=3];
17813 -> 12263[label="",style="dashed", color="red", weight=0];
17813[label="toEnum wy427",fontsize=16,color="magenta"];17813 -> 17833[label="",style="dashed", color="magenta", weight=3];
17814 -> 12264[label="",style="dashed", color="red", weight=0];
17814[label="toEnum wy427",fontsize=16,color="magenta"];17814 -> 17834[label="",style="dashed", color="magenta", weight=3];
17815 -> 12265[label="",style="dashed", color="red", weight=0];
17815[label="toEnum wy427",fontsize=16,color="magenta"];17815 -> 17835[label="",style="dashed", color="magenta", weight=3];
17816 -> 352[label="",style="dashed", color="red", weight=0];
17816[label="toEnum wy427",fontsize=16,color="magenta"];17816 -> 17836[label="",style="dashed", color="magenta", weight=3];
17817 -> 12267[label="",style="dashed", color="red", weight=0];
17817[label="toEnum wy427",fontsize=16,color="magenta"];17817 -> 17837[label="",style="dashed", color="magenta", weight=3];
17818 -> 12268[label="",style="dashed", color="red", weight=0];
17818[label="toEnum wy427",fontsize=16,color="magenta"];17818 -> 17838[label="",style="dashed", color="magenta", weight=3];
17819[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy401))) (primPlusInt (Neg (Succ wy403)) (Pos (Succ wy402))) (iterate (primPlusInt (Neg (Succ wy403))) (primPlusInt (Neg (Succ wy403)) (primPlusInt (Neg (Succ wy403)) (Pos (Succ wy402))))) (flip (<=) (Pos (Succ wy401)) (primPlusInt (Neg (Succ wy403)) (Pos (Succ wy402)))))\n  Enum a",fontsize=16,color="black",shape="box"];17819 -> 17839[label="",style="solid", color="black", weight=3];
16866[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy306))) (primPlusInt (Neg (Succ wy309)) (Neg wy360)) (iterate (primPlusInt (Neg (Succ wy309))) (primPlusInt (Neg (Succ wy309)) (primPlusInt (Neg (Succ wy309)) (Neg wy360)))) (compare (primPlusInt (Neg (Succ wy309)) (Neg wy360)) (Pos (Succ wy306)) /= GT))\n  Enum a",fontsize=16,color="black",shape="box"];16866 -> 16915[label="",style="solid", color="black", weight=3];
15840[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy306))) (primPlusInt (Neg (Succ wy309)) (Pos Zero)) (iterate (primPlusInt (Neg (Succ wy309))) (primPlusInt (Neg (Succ wy309)) (primPlusInt (Neg (Succ wy309)) (Pos Zero)))) (not (compare (primPlusInt (Neg (Succ wy309)) (Pos Zero)) (Pos (Succ wy306)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];15840 -> 15956[label="",style="solid", color="black", weight=3];
18264[label="map toEnum (takeWhile1 (flip (>=) (Neg (Succ wy443))) (primPlusInt (Neg (Succ wy445)) (Neg wy446)) (iterate (primPlusInt (Neg (Succ wy445))) (primPlusInt (Neg (Succ wy445)) (primPlusInt (Neg (Succ wy445)) (Neg wy446)))) (compare (primPlusInt (Neg (Succ wy445)) (Neg wy446)) (Neg (Succ wy443)) /= LT))\n  Enum a",fontsize=16,color="black",shape="box"];18264 -> 18265[label="",style="solid", color="black", weight=3];
16724[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy339))) (primPlusInt (Pos (Succ wy341)) (Pos wy342)) (iterate (primPlusInt (Pos (Succ wy341))) (primPlusInt (Pos (Succ wy341)) (primPlusInt (Pos (Succ wy341)) (Pos wy342)))) (not (compare (primPlusInt (Pos (Succ wy341)) (Pos wy342)) (Pos (Succ wy339)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];16724 -> 16799[label="",style="solid", color="black", weight=3];
18001[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy422))) (primPlusInt (Neg (Succ wy424)) (Pos (Succ wy423))) (iterate (primPlusInt (Neg (Succ wy424))) (primPlusInt (Neg (Succ wy424)) (primPlusInt (Neg (Succ wy424)) (Pos (Succ wy423))))) ((>=) primPlusInt (Neg (Succ wy424)) (Pos (Succ wy423)) Pos (Succ wy422)))\n  Enum a",fontsize=16,color="black",shape="box"];18001 -> 18017[label="",style="solid", color="black", weight=3];
18002[label="wy430",fontsize=16,color="green",shape="box"];18003[label="wy430",fontsize=16,color="green",shape="box"];18004[label="wy430",fontsize=16,color="green",shape="box"];18005[label="wy430",fontsize=16,color="green",shape="box"];18006[label="wy430",fontsize=16,color="green",shape="box"];18007[label="wy430",fontsize=16,color="green",shape="box"];18008[label="wy430",fontsize=16,color="green",shape="box"];18009[label="wy430",fontsize=16,color="green",shape="box"];18010[label="wy430",fontsize=16,color="green",shape="box"];16798[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy347))) (primPlusInt (Pos Zero) (Pos wy349)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos wy349)))) (not (compare (primPlusInt (Pos Zero) (Pos wy349)) (Pos (Succ wy347)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];16798 -> 16868[label="",style="solid", color="black", weight=3];
17830[label="wy427",fontsize=16,color="green",shape="box"];17831[label="wy427",fontsize=16,color="green",shape="box"];17832[label="wy427",fontsize=16,color="green",shape="box"];17833[label="wy427",fontsize=16,color="green",shape="box"];17834[label="wy427",fontsize=16,color="green",shape="box"];17835[label="wy427",fontsize=16,color="green",shape="box"];17836[label="wy427",fontsize=16,color="green",shape="box"];17837[label="wy427",fontsize=16,color="green",shape="box"];17838[label="wy427",fontsize=16,color="green",shape="box"];17839[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy401))) (primPlusInt (Neg (Succ wy403)) (Pos (Succ wy402))) (iterate (primPlusInt (Neg (Succ wy403))) (primPlusInt (Neg (Succ wy403)) (primPlusInt (Neg (Succ wy403)) (Pos (Succ wy402))))) ((<=) primPlusInt (Neg (Succ wy403)) (Pos (Succ wy402)) Pos (Succ wy401)))\n  Enum a",fontsize=16,color="black",shape="box"];17839 -> 17859[label="",style="solid", color="black", weight=3];
16915[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy306))) (primPlusInt (Neg (Succ wy309)) (Neg wy360)) (iterate (primPlusInt (Neg (Succ wy309))) (primPlusInt (Neg (Succ wy309)) (primPlusInt (Neg (Succ wy309)) (Neg wy360)))) (not (compare (primPlusInt (Neg (Succ wy309)) (Neg wy360)) (Pos (Succ wy306)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];16915 -> 16932[label="",style="solid", color="black", weight=3];
15956[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy306))) (primPlusInt (Neg (Succ wy309)) (Pos Zero)) (iterate (primPlusInt (Neg (Succ wy309))) (primPlusInt (Neg (Succ wy309)) (primPlusInt (Neg (Succ wy309)) (Pos Zero)))) (not (primCmpInt (primPlusInt (Neg (Succ wy309)) (Pos Zero)) (Pos (Succ wy306)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];15956 -> 16039[label="",style="solid", color="black", weight=3];
18265[label="map toEnum (takeWhile1 (flip (>=) (Neg (Succ wy443))) (primPlusInt (Neg (Succ wy445)) (Neg wy446)) (iterate (primPlusInt (Neg (Succ wy445))) (primPlusInt (Neg (Succ wy445)) (primPlusInt (Neg (Succ wy445)) (Neg wy446)))) (not (compare (primPlusInt (Neg (Succ wy445)) (Neg wy446)) (Neg (Succ wy443)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];18265 -> 18266[label="",style="solid", color="black", weight=3];
16799[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy339))) (primPlusInt (Pos (Succ wy341)) (Pos wy342)) (iterate (primPlusInt (Pos (Succ wy341))) (primPlusInt (Pos (Succ wy341)) (primPlusInt (Pos (Succ wy341)) (Pos wy342)))) (not (primCmpInt (primPlusInt (Pos (Succ wy341)) (Pos wy342)) (Pos (Succ wy339)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];16799 -> 16869[label="",style="solid", color="black", weight=3];
18017[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy422))) (primPlusInt (Neg (Succ wy424)) (Pos (Succ wy423))) (iterate (primPlusInt (Neg (Succ wy424))) (primPlusInt (Neg (Succ wy424)) (primPlusInt (Neg (Succ wy424)) (Pos (Succ wy423))))) (compare (primPlusInt (Neg (Succ wy424)) (Pos (Succ wy423))) (Pos (Succ wy422)) /= LT))\n  Enum a",fontsize=16,color="black",shape="box"];18017 -> 18056[label="",style="solid", color="black", weight=3];
16868[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy347))) (primPlusInt (Pos Zero) (Pos wy349)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (primPlusInt (Pos Zero) (Pos wy349)))) (not (primCmpInt (primPlusInt (Pos Zero) (Pos wy349)) (Pos (Succ wy347)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];16868 -> 16917[label="",style="solid", color="black", weight=3];
17859[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy401))) (primPlusInt (Neg (Succ wy403)) (Pos (Succ wy402))) (iterate (primPlusInt (Neg (Succ wy403))) (primPlusInt (Neg (Succ wy403)) (primPlusInt (Neg (Succ wy403)) (Pos (Succ wy402))))) (compare (primPlusInt (Neg (Succ wy403)) (Pos (Succ wy402))) (Pos (Succ wy401)) /= GT))\n  Enum a",fontsize=16,color="black",shape="box"];17859 -> 17878[label="",style="solid", color="black", weight=3];
16932[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy306))) (primPlusInt (Neg (Succ wy309)) (Neg wy360)) (iterate (primPlusInt (Neg (Succ wy309))) (primPlusInt (Neg (Succ wy309)) (primPlusInt (Neg (Succ wy309)) (Neg wy360)))) (not (primCmpInt (primPlusInt (Neg (Succ wy309)) (Neg wy360)) (Pos (Succ wy306)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];16932 -> 16989[label="",style="solid", color="black", weight=3];
16039 -> 13967[label="",style="dashed", color="red", weight=0];
16039[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy306))) (primMinusNat Zero (Succ wy309)) (iterate (primPlusInt (Neg (Succ wy309))) (primPlusInt (Neg (Succ wy309)) (primMinusNat Zero (Succ wy309)))) (not (primCmpInt (primMinusNat Zero (Succ wy309)) (Pos (Succ wy306)) == GT)))\n  Enum a",fontsize=16,color="magenta"];16039 -> 16094[label="",style="dashed", color="magenta", weight=3];
16039 -> 16095[label="",style="dashed", color="magenta", weight=3];
18266[label="map toEnum (takeWhile1 (flip (>=) (Neg (Succ wy443))) (primPlusInt (Neg (Succ wy445)) (Neg wy446)) (iterate (primPlusInt (Neg (Succ wy445))) (primPlusInt (Neg (Succ wy445)) (primPlusInt (Neg (Succ wy445)) (Neg wy446)))) (not (primCmpInt (primPlusInt (Neg (Succ wy445)) (Neg wy446)) (Neg (Succ wy443)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];18266 -> 18267[label="",style="solid", color="black", weight=3];
16869 -> 11408[label="",style="dashed", color="red", weight=0];
16869[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy339))) (Pos (primPlusNat (Succ wy341) wy342)) (iterate (primPlusInt (Pos (Succ wy341))) (primPlusInt (Pos (Succ wy341)) (Pos (primPlusNat (Succ wy341) wy342)))) (not (primCmpInt (Pos (primPlusNat (Succ wy341) wy342)) (Pos (Succ wy339)) == LT)))\n  Enum a",fontsize=16,color="magenta"];16869 -> 16918[label="",style="dashed", color="magenta", weight=3];
16869 -> 16919[label="",style="dashed", color="magenta", weight=3];
16869 -> 16920[label="",style="dashed", color="magenta", weight=3];
16869 -> 16921[label="",style="dashed", color="magenta", weight=3];
16869 -> 16922[label="",style="dashed", color="magenta", weight=3];
18056[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy422))) (primPlusInt (Neg (Succ wy424)) (Pos (Succ wy423))) (iterate (primPlusInt (Neg (Succ wy424))) (primPlusInt (Neg (Succ wy424)) (primPlusInt (Neg (Succ wy424)) (Pos (Succ wy423))))) (not (compare (primPlusInt (Neg (Succ wy424)) (Pos (Succ wy423))) (Pos (Succ wy422)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];18056 -> 18066[label="",style="solid", color="black", weight=3];
16917 -> 11413[label="",style="dashed", color="red", weight=0];
16917[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy347))) (Pos (primPlusNat Zero wy349)) (iterate (primPlusInt (Pos Zero)) (primPlusInt (Pos Zero) (Pos (primPlusNat Zero wy349)))) (not (primCmpInt (Pos (primPlusNat Zero wy349)) (Pos (Succ wy347)) == LT)))\n  Enum a",fontsize=16,color="magenta"];16917 -> 16934[label="",style="dashed", color="magenta", weight=3];
16917 -> 16935[label="",style="dashed", color="magenta", weight=3];
16917 -> 16936[label="",style="dashed", color="magenta", weight=3];
16917 -> 16937[label="",style="dashed", color="magenta", weight=3];
17878[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy401))) (primPlusInt (Neg (Succ wy403)) (Pos (Succ wy402))) (iterate (primPlusInt (Neg (Succ wy403))) (primPlusInt (Neg (Succ wy403)) (primPlusInt (Neg (Succ wy403)) (Pos (Succ wy402))))) (not (compare (primPlusInt (Neg (Succ wy403)) (Pos (Succ wy402))) (Pos (Succ wy401)) == GT)))\n  Enum a",fontsize=16,color="black",shape="box"];17878 -> 17890[label="",style="solid", color="black", weight=3];
16989 -> 16010[label="",style="dashed", color="red", weight=0];
16989[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy306))) (Neg (primPlusNat (Succ wy309) wy360)) (iterate (primPlusInt (Neg (Succ wy309))) (primPlusInt (Neg (Succ wy309)) (Neg (primPlusNat (Succ wy309) wy360)))) (not (primCmpInt (Neg (primPlusNat (Succ wy309) wy360)) (Pos (Succ wy306)) == GT)))\n  Enum a",fontsize=16,color="magenta"];16989 -> 16994[label="",style="dashed", color="magenta", weight=3];
16989 -> 16995[label="",style="dashed", color="magenta", weight=3];
16989 -> 16996[label="",style="dashed", color="magenta", weight=3];
16094[label="Succ wy309",fontsize=16,color="green",shape="box"];16095[label="Zero",fontsize=16,color="green",shape="box"];18267 -> 18268[label="",style="dashed", color="red", weight=0];
18267[label="map toEnum (takeWhile1 (flip (>=) (Neg (Succ wy443))) (Neg (primPlusNat (Succ wy445) wy446)) (iterate (primPlusInt (Neg (Succ wy445))) (primPlusInt (Neg (Succ wy445)) (Neg (primPlusNat (Succ wy445) wy446)))) (not (primCmpInt (Neg (primPlusNat (Succ wy445) wy446)) (Neg (Succ wy443)) == LT)))\n  Enum a",fontsize=16,color="magenta"];18267 -> 18269[label="",style="dashed", color="magenta", weight=3];
18267 -> 18270[label="",style="dashed", color="magenta", weight=3];
18267 -> 18271[label="",style="dashed", color="magenta", weight=3];
16918 -> 5172[label="",style="dashed", color="red", weight=0];
16918[label="primPlusNat (Succ wy341) wy342",fontsize=16,color="magenta"];16918 -> 16938[label="",style="dashed", color="magenta", weight=3];
16918 -> 16939[label="",style="dashed", color="magenta", weight=3];
16919 -> 5172[label="",style="dashed", color="red", weight=0];
16919[label="primPlusNat (Succ wy341) wy342",fontsize=16,color="magenta"];16919 -> 16940[label="",style="dashed", color="magenta", weight=3];
16919 -> 16941[label="",style="dashed", color="magenta", weight=3];
16920 -> 5172[label="",style="dashed", color="red", weight=0];
16920[label="primPlusNat (Succ wy341) wy342",fontsize=16,color="magenta"];16920 -> 16942[label="",style="dashed", color="magenta", weight=3];
16920 -> 16943[label="",style="dashed", color="magenta", weight=3];
16921[label="wy341",fontsize=16,color="green",shape="box"];16922[label="wy339",fontsize=16,color="green",shape="box"];18066 -> 11342[label="",style="dashed", color="red", weight=0];
18066[label="map toEnum (takeWhile1 (flip (>=) (Pos (Succ wy422))) (primPlusInt (Neg (Succ wy424)) (Pos (Succ wy423))) (iterate (primPlusInt (Neg (Succ wy424))) (primPlusInt (Neg (Succ wy424)) (primPlusInt (Neg (Succ wy424)) (Pos (Succ wy423))))) (not (primCmpInt (primPlusInt (Neg (Succ wy424)) (Pos (Succ wy423))) (Pos (Succ wy422)) == LT)))\n  Enum a",fontsize=16,color="magenta"];18066 -> 18072[label="",style="dashed", color="magenta", weight=3];
18066 -> 18073[label="",style="dashed", color="magenta", weight=3];
18066 -> 18074[label="",style="dashed", color="magenta", weight=3];
16934 -> 5172[label="",style="dashed", color="red", weight=0];
16934[label="primPlusNat Zero wy349",fontsize=16,color="magenta"];16934 -> 16997[label="",style="dashed", color="magenta", weight=3];
16934 -> 16998[label="",style="dashed", color="magenta", weight=3];
16935 -> 5172[label="",style="dashed", color="red", weight=0];
16935[label="primPlusNat Zero wy349",fontsize=16,color="magenta"];16935 -> 16999[label="",style="dashed", color="magenta", weight=3];
16935 -> 17000[label="",style="dashed", color="magenta", weight=3];
16936[label="wy347",fontsize=16,color="green",shape="box"];16937 -> 5172[label="",style="dashed", color="red", weight=0];
16937[label="primPlusNat Zero wy349",fontsize=16,color="magenta"];16937 -> 17001[label="",style="dashed", color="magenta", weight=3];
16937 -> 17002[label="",style="dashed", color="magenta", weight=3];
17890 -> 10126[label="",style="dashed", color="red", weight=0];
17890[label="map toEnum (takeWhile1 (flip (<=) (Pos (Succ wy401))) (primPlusInt (Neg (Succ wy403)) (Pos (Succ wy402))) (iterate (primPlusInt (Neg (Succ wy403))) (primPlusInt (Neg (Succ wy403)) (primPlusInt (Neg (Succ wy403)) (Pos (Succ wy402))))) (not (primCmpInt (primPlusInt (Neg (Succ wy403)) (Pos (Succ wy402))) (Pos (Succ wy401)) == GT)))\n  Enum a",fontsize=16,color="magenta"];17890 -> 17921[label="",style="dashed", color="magenta", weight=3];
17890 -> 17922[label="",style="dashed", color="magenta", weight=3];
17890 -> 17923[label="",style="dashed", color="magenta", weight=3];
16994 -> 5172[label="",style="dashed", color="red", weight=0];
16994[label="primPlusNat (Succ wy309) wy360",fontsize=16,color="magenta"];16994 -> 17235[label="",style="dashed", color="magenta", weight=3];
16994 -> 17236[label="",style="dashed", color="magenta", weight=3];
16995 -> 5172[label="",style="dashed", color="red", weight=0];
16995[label="primPlusNat (Succ wy309) wy360",fontsize=16,color="magenta"];16995 -> 17237[label="",style="dashed", color="magenta", weight=3];
16995 -> 17238[label="",style="dashed", color="magenta", weight=3];
16996 -> 5172[label="",style="dashed", color="red", weight=0];
16996[label="primPlusNat (Succ wy309) wy360",fontsize=16,color="magenta"];16996 -> 17239[label="",style="dashed", color="magenta", weight=3];
16996 -> 17240[label="",style="dashed", color="magenta", weight=3];
18269 -> 5172[label="",style="dashed", color="red", weight=0];
18269[label="primPlusNat (Succ wy445) wy446",fontsize=16,color="magenta"];18269 -> 18272[label="",style="dashed", color="magenta", weight=3];
18269 -> 18273[label="",style="dashed", color="magenta", weight=3];
18270 -> 5172[label="",style="dashed", color="red", weight=0];
18270[label="primPlusNat (Succ wy445) wy446",fontsize=16,color="magenta"];18270 -> 18274[label="",style="dashed", color="magenta", weight=3];
18270 -> 18275[label="",style="dashed", color="magenta", weight=3];
18271 -> 5172[label="",style="dashed", color="red", weight=0];
18271[label="primPlusNat (Succ wy445) wy446",fontsize=16,color="magenta"];18271 -> 18276[label="",style="dashed", color="magenta", weight=3];
18271 -> 18277[label="",style="dashed", color="magenta", weight=3];
18268[label="map toEnum (takeWhile1 (flip (>=) (Neg (Succ wy443))) (Neg wy450) (iterate (primPlusInt (Neg (Succ wy445))) (primPlusInt (Neg (Succ wy445)) (Neg wy451))) (not (primCmpInt (Neg wy452) (Neg (Succ wy443)) == LT)))\n  Enum a",fontsize=16,color="burlywood",shape="triangle"];19156[label="wy452/Succ wy4520",fontsize=10,color="white",style="solid",shape="box"];18268 -> 19156[label="",style="solid", color="burlywood", weight=9];
19156 -> 18278[label="",style="solid", color="burlywood", weight=3];
19157[label="wy452/Zero",fontsize=10,color="white",style="solid",shape="box"];18268 -> 19157[label="",style="solid", color="burlywood", weight=9];
19157 -> 18279[label="",style="solid", color="burlywood", weight=3];
16938[label="wy342",fontsize=16,color="green",shape="box"];16939[label="Succ wy341",fontsize=16,color="green",shape="box"];16940[label="wy342",fontsize=16,color="green",shape="box"];16941[label="Succ wy341",fontsize=16,color="green",shape="box"];16942[label="wy342",fontsize=16,color="green",shape="box"];16943[label="Succ wy341",fontsize=16,color="green",shape="box"];18072[label="wy424",fontsize=16,color="green",shape="box"];18073[label="wy423",fontsize=16,color="green",shape="box"];18074[label="wy422",fontsize=16,color="green",shape="box"];16997[label="wy349",fontsize=16,color="green",shape="box"];16998[label="Zero",fontsize=16,color="green",shape="box"];16999[label="wy349",fontsize=16,color="green",shape="box"];17000[label="Zero",fontsize=16,color="green",shape="box"];17001[label="wy349",fontsize=16,color="green",shape="box"];17002[label="Zero",fontsize=16,color="green",shape="box"];17921[label="wy402",fontsize=16,color="green",shape="box"];17922[label="wy403",fontsize=16,color="green",shape="box"];17923[label="wy401",fontsize=16,color="green",shape="box"];17235[label="wy360",fontsize=16,color="green",shape="box"];17236[label="Succ wy309",fontsize=16,color="green",shape="box"];17237[label="wy360",fontsize=16,color="green",shape="box"];17238[label="Succ wy309",fontsize=16,color="green",shape="box"];17239[label="wy360",fontsize=16,color="green",shape="box"];17240[label="Succ wy309",fontsize=16,color="green",shape="box"];18272[label="wy446",fontsize=16,color="green",shape="box"];18273[label="Succ wy445",fontsize=16,color="green",shape="box"];18274[label="wy446",fontsize=16,color="green",shape="box"];18275[label="Succ wy445",fontsize=16,color="green",shape="box"];18276[label="wy446",fontsize=16,color="green",shape="box"];18277[label="Succ wy445",fontsize=16,color="green",shape="box"];18278[label="map toEnum (takeWhile1 (flip (>=) (Neg (Succ wy443))) (Neg wy450) (iterate (primPlusInt (Neg (Succ wy445))) (primPlusInt (Neg (Succ wy445)) (Neg wy451))) (not (primCmpInt (Neg (Succ wy4520)) (Neg (Succ wy443)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];18278 -> 18280[label="",style="solid", color="black", weight=3];
18279[label="map toEnum (takeWhile1 (flip (>=) (Neg (Succ wy443))) (Neg wy450) (iterate (primPlusInt (Neg (Succ wy445))) (primPlusInt (Neg (Succ wy445)) (Neg wy451))) (not (primCmpInt (Neg Zero) (Neg (Succ wy443)) == LT)))\n  Enum a",fontsize=16,color="black",shape="box"];18279 -> 18281[label="",style="solid", color="black", weight=3];
18280 -> 18113[label="",style="dashed", color="red", weight=0];
18280[label="map toEnum (takeWhile1 (flip (>=) (Neg (Succ wy443))) (Neg wy450) (iterate (primPlusInt (Neg (Succ wy445))) (primPlusInt (Neg (Succ wy445)) (Neg wy451))) (not (primCmpNat (Succ wy443) (Succ wy4520) == LT)))\n  Enum a",fontsize=16,color="magenta"];18280 -> 18282[label="",style="dashed", color="magenta", weight=3];
18280 -> 18283[label="",style="dashed", color="magenta", weight=3];
18280 -> 18284[label="",style="dashed", color="magenta", weight=3];
18280 -> 18285[label="",style="dashed", color="magenta", weight=3];
18281 -> 18113[label="",style="dashed", color="red", weight=0];
18281[label="map toEnum (takeWhile1 (flip (>=) (Neg (Succ wy443))) (Neg wy450) (iterate (primPlusInt (Neg (Succ wy445))) (primPlusInt (Neg (Succ wy445)) (Neg wy451))) (not (primCmpNat (Succ wy443) Zero == LT)))\n  Enum a",fontsize=16,color="magenta"];18281 -> 18286[label="",style="dashed", color="magenta", weight=3];
18281 -> 18287[label="",style="dashed", color="magenta", weight=3];
18281 -> 18288[label="",style="dashed", color="magenta", weight=3];
18281 -> 18289[label="",style="dashed", color="magenta", weight=3];
18282[label="Succ wy4520",fontsize=16,color="green",shape="box"];18283[label="Succ wy443",fontsize=16,color="green",shape="box"];18284[label="wy451",fontsize=16,color="green",shape="box"];18285[label="wy450",fontsize=16,color="green",shape="box"];18286[label="Zero",fontsize=16,color="green",shape="box"];18287[label="Succ wy443",fontsize=16,color="green",shape="box"];18288[label="wy451",fontsize=16,color="green",shape="box"];18289[label="wy450",fontsize=16,color="green",shape="box"];}

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                    ↳ QDPSizeChangeProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_primPlusNat(Succ(wy1050), Succ(wy1040)) → new_primPlusNat(wy1050, wy1040)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

new_primPlusNat(Succ(wy1050), Succ(wy1040)) → new_primPlusNat(wy1050, wy1040)
The graph contains the following edges 1 > 1, 2 > 2

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                    ↳ NonTerminationProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map → new_map

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We used the non-termination processor [17] to show that the DP problem is infinite.
Found a loop by semiunifying a rule from P directly.

The TRS P consists of the following rules:

new_map → new_map

The TRS R consists of the following rules:none

s = new_map evaluates to t =new_map

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:

Semiunifier: [ ]
Matcher: [ ]

Rewriting sequence

The DP semiunifies directly so there is only one rewrite step from new_map to new_map.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map2(wy187, wy198, wy199, ba) → new_map0(wy187, new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), ba)
new_map0(wy187, wy198, wy199, Succ(wy2000), ba) → new_map0(wy187, new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), ba)
new_map0(Succ(wy1870), wy198, wy199, Zero, ba) → new_map1(Succ(wy1870), wy198, wy199, ba)
new_map1(wy187, wy198, wy199, ba) → new_map0(wy187, new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), ba)
new_map0(Zero, wy198, wy199, Zero, ba) → new_map2(Zero, wy198, wy199, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [15] we can delete all non-usable rules [17] from R.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map2(wy187, wy198, wy199, ba) → new_map0(wy187, new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), ba)
new_map0(wy187, wy198, wy199, Succ(wy2000), ba) → new_map0(wy187, new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), ba)
new_map0(Succ(wy1870), wy198, wy199, Zero, ba) → new_map1(Succ(wy1870), wy198, wy199, ba)
new_map1(wy187, wy198, wy199, ba) → new_map0(wy187, new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), ba)
new_map0(Zero, wy198, wy199, Zero, ba) → new_map2(Zero, wy198, wy199, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule new_map2(wy187, wy198, wy199, ba) → new_map0(wy187, new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), ba) at position [3] we obtained the following new rules:

new_map2(y0, y1, Succ(x0), y3) → new_map0(y0, new_primPlusNat0(Zero, Succ(x0)), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y3)
new_map2(y0, y1, Zero, y3) → new_map0(y0, new_primPlusNat0(Zero, Zero), new_primPlusNat0(Zero, Zero), Zero, y3)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map0(wy187, wy198, wy199, Succ(wy2000), ba) → new_map0(wy187, new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), ba)
new_map2(y0, y1, Succ(x0), y3) → new_map0(y0, new_primPlusNat0(Zero, Succ(x0)), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y3)
new_map2(y0, y1, Zero, y3) → new_map0(y0, new_primPlusNat0(Zero, Zero), new_primPlusNat0(Zero, Zero), Zero, y3)
new_map1(wy187, wy198, wy199, ba) → new_map0(wy187, new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), ba)
new_map0(Succ(wy1870), wy198, wy199, Zero, ba) → new_map1(Succ(wy1870), wy198, wy199, ba)
new_map0(Zero, wy198, wy199, Zero, ba) → new_map2(Zero, wy198, wy199, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map2(y0, y1, Succ(x0), y3) → new_map0(y0, new_primPlusNat0(Zero, Succ(x0)), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y3) at position [1] we obtained the following new rules:

new_map2(y0, y1, Succ(x0), y3) → new_map0(y0, Succ(x0), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y3)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map2(y0, y1, Succ(x0), y3) → new_map0(y0, Succ(x0), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y3)
new_map0(wy187, wy198, wy199, Succ(wy2000), ba) → new_map0(wy187, new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), ba)
new_map0(Succ(wy1870), wy198, wy199, Zero, ba) → new_map1(Succ(wy1870), wy198, wy199, ba)
new_map1(wy187, wy198, wy199, ba) → new_map0(wy187, new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), ba)
new_map2(y0, y1, Zero, y3) → new_map0(y0, new_primPlusNat0(Zero, Zero), new_primPlusNat0(Zero, Zero), Zero, y3)
new_map0(Zero, wy198, wy199, Zero, ba) → new_map2(Zero, wy198, wy199, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map2(y0, y1, Zero, y3) → new_map0(y0, new_primPlusNat0(Zero, Zero), new_primPlusNat0(Zero, Zero), Zero, y3) at position [1] we obtained the following new rules:

new_map2(y0, y1, Zero, y3) → new_map0(y0, Zero, new_primPlusNat0(Zero, Zero), Zero, y3)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map2(y0, y1, Succ(x0), y3) → new_map0(y0, Succ(x0), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y3)
new_map0(wy187, wy198, wy199, Succ(wy2000), ba) → new_map0(wy187, new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), ba)
new_map2(y0, y1, Zero, y3) → new_map0(y0, Zero, new_primPlusNat0(Zero, Zero), Zero, y3)
new_map1(wy187, wy198, wy199, ba) → new_map0(wy187, new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), ba)
new_map0(Succ(wy1870), wy198, wy199, Zero, ba) → new_map1(Succ(wy1870), wy198, wy199, ba)
new_map0(Zero, wy198, wy199, Zero, ba) → new_map2(Zero, wy198, wy199, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map2(y0, y1, Succ(x0), y3) → new_map0(y0, Succ(x0), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y3) at position [2] we obtained the following new rules:

new_map2(y0, y1, Succ(x0), y3) → new_map0(y0, Succ(x0), Succ(x0), Succ(x0), y3)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map0(wy187, wy198, wy199, Succ(wy2000), ba) → new_map0(wy187, new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), ba)
new_map2(y0, y1, Zero, y3) → new_map0(y0, Zero, new_primPlusNat0(Zero, Zero), Zero, y3)
new_map0(Succ(wy1870), wy198, wy199, Zero, ba) → new_map1(Succ(wy1870), wy198, wy199, ba)
new_map1(wy187, wy198, wy199, ba) → new_map0(wy187, new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), ba)
new_map2(y0, y1, Succ(x0), y3) → new_map0(y0, Succ(x0), Succ(x0), Succ(x0), y3)
new_map0(Zero, wy198, wy199, Zero, ba) → new_map2(Zero, wy198, wy199, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map2(y0, y1, Zero, y3) → new_map0(y0, Zero, new_primPlusNat0(Zero, Zero), Zero, y3) at position [2] we obtained the following new rules:

new_map2(y0, y1, Zero, y3) → new_map0(y0, Zero, Zero, Zero, y3)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map0(wy187, wy198, wy199, Succ(wy2000), ba) → new_map0(wy187, new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), ba)
new_map1(wy187, wy198, wy199, ba) → new_map0(wy187, new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), ba)
new_map0(Succ(wy1870), wy198, wy199, Zero, ba) → new_map1(Succ(wy1870), wy198, wy199, ba)
new_map2(y0, y1, Zero, y3) → new_map0(y0, Zero, Zero, Zero, y3)
new_map2(y0, y1, Succ(x0), y3) → new_map0(y0, Succ(x0), Succ(x0), Succ(x0), y3)
new_map0(Zero, wy198, wy199, Zero, ba) → new_map2(Zero, wy198, wy199, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule new_map0(wy187, wy198, wy199, Succ(wy2000), ba) → new_map0(wy187, new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), ba) at position [3] we obtained the following new rules:

new_map0(y0, y1, Succ(x0), Succ(y3), y4) → new_map0(y0, new_primPlusNat0(Zero, Succ(x0)), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y4)
new_map0(y0, y1, Zero, Succ(y3), y4) → new_map0(y0, new_primPlusNat0(Zero, Zero), new_primPlusNat0(Zero, Zero), Zero, y4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map0(y0, y1, Succ(x0), Succ(y3), y4) → new_map0(y0, new_primPlusNat0(Zero, Succ(x0)), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y4)
new_map0(y0, y1, Zero, Succ(y3), y4) → new_map0(y0, new_primPlusNat0(Zero, Zero), new_primPlusNat0(Zero, Zero), Zero, y4)
new_map0(Succ(wy1870), wy198, wy199, Zero, ba) → new_map1(Succ(wy1870), wy198, wy199, ba)
new_map1(wy187, wy198, wy199, ba) → new_map0(wy187, new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), ba)
new_map2(y0, y1, Succ(x0), y3) → new_map0(y0, Succ(x0), Succ(x0), Succ(x0), y3)
new_map2(y0, y1, Zero, y3) → new_map0(y0, Zero, Zero, Zero, y3)
new_map0(Zero, wy198, wy199, Zero, ba) → new_map2(Zero, wy198, wy199, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 2 SCCs with 1 less node.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ AND

                                                    ↳ QDP

                                                      ↳ UsableRulesProof

                                                    ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map0(y0, y1, Succ(x0), Succ(y3), y4) → new_map0(y0, new_primPlusNat0(Zero, Succ(x0)), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y4)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ AND

                                                    ↳ QDP

                                                      ↳ UsableRulesProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                    ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map0(y0, y1, Succ(x0), Succ(y3), y4) → new_map0(y0, new_primPlusNat0(Zero, Succ(x0)), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y4)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map0(y0, y1, Succ(x0), Succ(y3), y4) → new_map0(y0, new_primPlusNat0(Zero, Succ(x0)), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y4) at position [1] we obtained the following new rules:

new_map0(y0, y1, Succ(x0), Succ(y3), y4) → new_map0(y0, Succ(x0), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ AND

                                                    ↳ QDP

                                                      ↳ UsableRulesProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                    ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map0(y0, y1, Succ(x0), Succ(y3), y4) → new_map0(y0, Succ(x0), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y4)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map0(y0, y1, Succ(x0), Succ(y3), y4) → new_map0(y0, Succ(x0), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y4) at position [2] we obtained the following new rules:

new_map0(y0, y1, Succ(x0), Succ(y3), y4) → new_map0(y0, Succ(x0), Succ(x0), Succ(x0), y4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ AND

                                                    ↳ QDP

                                                      ↳ UsableRulesProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map0(y0, y1, Succ(x0), Succ(y3), y4) → new_map0(y0, Succ(x0), Succ(x0), Succ(x0), y4)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ AND

                                                    ↳ QDP

                                                      ↳ UsableRulesProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ UsableRulesProof

                                                                    ↳ QDP

                                                                      ↳ QReductionProof

                                                    ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map0(y0, y1, Succ(x0), Succ(y3), y4) → new_map0(y0, Succ(x0), Succ(x0), Succ(x0), y4)

R is empty.
The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ AND

                                                    ↳ QDP

                                                      ↳ UsableRulesProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ UsableRulesProof

                                                                    ↳ QDP

                                                                      ↳ QReductionProof

                                                                        ↳ QDP

                                                                          ↳ Instantiation

                                                    ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map0(y0, y1, Succ(x0), Succ(y3), y4) → new_map0(y0, Succ(x0), Succ(x0), Succ(x0), y4)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_map0(y0, y1, Succ(x0), Succ(y3), y4) → new_map0(y0, Succ(x0), Succ(x0), Succ(x0), y4) we obtained the following new rules:

new_map0(z0, Succ(z2), Succ(z2), Succ(z2), z4) → new_map0(z0, Succ(z2), Succ(z2), Succ(z2), z4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ AND

                                                    ↳ QDP

                                                      ↳ UsableRulesProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ UsableRulesProof

                                                                    ↳ QDP

                                                                      ↳ QReductionProof

                                                                        ↳ QDP

                                                                          ↳ Instantiation

                                                                            ↳ QDP

                                                                              ↳ NonTerminationProof

                                                    ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map0(z0, Succ(z2), Succ(z2), Succ(z2), z4) → new_map0(z0, Succ(z2), Succ(z2), Succ(z2), z4)

The TRS R consists of the following rules:none

s = new_map0(z0, Succ(z2), Succ(z2), Succ(z2), z4) evaluates to t =new_map0(z0, Succ(z2), Succ(z2), Succ(z2), z4)

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:

Semiunifier: [ ]
Matcher: [ ]

Rewriting sequence

The DP semiunifies directly so there is only one rewrite step from new_map0(z0, Succ(z2), Succ(z2), Succ(z2), z4) to new_map0(z0, Succ(z2), Succ(z2), Succ(z2), z4).

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ AND

                                                    ↳ QDP

                                                    ↳ QDP

                                                      ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map0(y0, y1, Zero, Succ(y3), y4) → new_map0(y0, new_primPlusNat0(Zero, Zero), new_primPlusNat0(Zero, Zero), Zero, y4)
new_map1(wy187, wy198, wy199, ba) → new_map0(wy187, new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), ba)
new_map0(Succ(wy1870), wy198, wy199, Zero, ba) → new_map1(Succ(wy1870), wy198, wy199, ba)
new_map2(y0, y1, Zero, y3) → new_map0(y0, Zero, Zero, Zero, y3)
new_map0(Zero, wy198, wy199, Zero, ba) → new_map2(Zero, wy198, wy199, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map0(y0, y1, Zero, Succ(y3), y4) → new_map0(y0, new_primPlusNat0(Zero, Zero), new_primPlusNat0(Zero, Zero), Zero, y4) at position [1] we obtained the following new rules:

new_map0(y0, y1, Zero, Succ(y3), y4) → new_map0(y0, Zero, new_primPlusNat0(Zero, Zero), Zero, y4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ AND

                                                    ↳ QDP

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map0(y0, y1, Zero, Succ(y3), y4) → new_map0(y0, Zero, new_primPlusNat0(Zero, Zero), Zero, y4)
new_map0(Succ(wy1870), wy198, wy199, Zero, ba) → new_map1(Succ(wy1870), wy198, wy199, ba)
new_map1(wy187, wy198, wy199, ba) → new_map0(wy187, new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), ba)
new_map2(y0, y1, Zero, y3) → new_map0(y0, Zero, Zero, Zero, y3)
new_map0(Zero, wy198, wy199, Zero, ba) → new_map2(Zero, wy198, wy199, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map0(y0, y1, Zero, Succ(y3), y4) → new_map0(y0, Zero, new_primPlusNat0(Zero, Zero), Zero, y4) at position [2] we obtained the following new rules:

new_map0(y0, y1, Zero, Succ(y3), y4) → new_map0(y0, Zero, Zero, Zero, y4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ AND

                                                    ↳ QDP

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Narrowing

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map0(y0, y1, Zero, Succ(y3), y4) → new_map0(y0, Zero, Zero, Zero, y4)
new_map1(wy187, wy198, wy199, ba) → new_map0(wy187, new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), ba)
new_map0(Succ(wy1870), wy198, wy199, Zero, ba) → new_map1(Succ(wy1870), wy198, wy199, ba)
new_map2(y0, y1, Zero, y3) → new_map0(y0, Zero, Zero, Zero, y3)
new_map0(Zero, wy198, wy199, Zero, ba) → new_map2(Zero, wy198, wy199, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule new_map1(wy187, wy198, wy199, ba) → new_map0(wy187, new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), new_primPlusNat0(Zero, wy199), ba) at position [3] we obtained the following new rules:

new_map1(y0, y1, Zero, y3) → new_map0(y0, new_primPlusNat0(Zero, Zero), new_primPlusNat0(Zero, Zero), Zero, y3)
new_map1(y0, y1, Succ(x0), y3) → new_map0(y0, new_primPlusNat0(Zero, Succ(x0)), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y3)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ AND

                                                    ↳ QDP

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Narrowing

                                                                ↳ QDP

                                                                  ↳ DependencyGraphProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map1(y0, y1, Succ(x0), y3) → new_map0(y0, new_primPlusNat0(Zero, Succ(x0)), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y3)
new_map1(y0, y1, Zero, y3) → new_map0(y0, new_primPlusNat0(Zero, Zero), new_primPlusNat0(Zero, Zero), Zero, y3)
new_map0(Succ(wy1870), wy198, wy199, Zero, ba) → new_map1(Succ(wy1870), wy198, wy199, ba)
new_map0(y0, y1, Zero, Succ(y3), y4) → new_map0(y0, Zero, Zero, Zero, y4)
new_map2(y0, y1, Zero, y3) → new_map0(y0, Zero, Zero, Zero, y3)
new_map0(Zero, wy198, wy199, Zero, ba) → new_map2(Zero, wy198, wy199, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 2 less nodes.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ AND

                                                    ↳ QDP

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Narrowing

                                                                ↳ QDP

                                                                  ↳ DependencyGraphProof

                                                                    ↳ QDP

                                                                      ↳ UsableRulesProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map1(y0, y1, Zero, y3) → new_map0(y0, new_primPlusNat0(Zero, Zero), new_primPlusNat0(Zero, Zero), Zero, y3)
new_map0(Succ(wy1870), wy198, wy199, Zero, ba) → new_map1(Succ(wy1870), wy198, wy199, ba)
new_map2(y0, y1, Zero, y3) → new_map0(y0, Zero, Zero, Zero, y3)
new_map0(Zero, wy198, wy199, Zero, ba) → new_map2(Zero, wy198, wy199, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ AND

                                                    ↳ QDP

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Narrowing

                                                                ↳ QDP

                                                                  ↳ DependencyGraphProof

                                                                    ↳ QDP

                                                                      ↳ UsableRulesProof

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map1(y0, y1, Zero, y3) → new_map0(y0, new_primPlusNat0(Zero, Zero), new_primPlusNat0(Zero, Zero), Zero, y3)
new_map0(Succ(wy1870), wy198, wy199, Zero, ba) → new_map1(Succ(wy1870), wy198, wy199, ba)
new_map2(y0, y1, Zero, y3) → new_map0(y0, Zero, Zero, Zero, y3)
new_map0(Zero, wy198, wy199, Zero, ba) → new_map2(Zero, wy198, wy199, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map1(y0, y1, Zero, y3) → new_map0(y0, new_primPlusNat0(Zero, Zero), new_primPlusNat0(Zero, Zero), Zero, y3) at position [1] we obtained the following new rules:

new_map1(y0, y1, Zero, y3) → new_map0(y0, Zero, new_primPlusNat0(Zero, Zero), Zero, y3)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ AND

                                                    ↳ QDP

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Narrowing

                                                                ↳ QDP

                                                                  ↳ DependencyGraphProof

                                                                    ↳ QDP

                                                                      ↳ UsableRulesProof

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map1(y0, y1, Zero, y3) → new_map0(y0, Zero, new_primPlusNat0(Zero, Zero), Zero, y3)
new_map0(Succ(wy1870), wy198, wy199, Zero, ba) → new_map1(Succ(wy1870), wy198, wy199, ba)
new_map2(y0, y1, Zero, y3) → new_map0(y0, Zero, Zero, Zero, y3)
new_map0(Zero, wy198, wy199, Zero, ba) → new_map2(Zero, wy198, wy199, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map1(y0, y1, Zero, y3) → new_map0(y0, Zero, new_primPlusNat0(Zero, Zero), Zero, y3) at position [2] we obtained the following new rules:

new_map1(y0, y1, Zero, y3) → new_map0(y0, Zero, Zero, Zero, y3)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ AND

                                                    ↳ QDP

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Narrowing

                                                                ↳ QDP

                                                                  ↳ DependencyGraphProof

                                                                    ↳ QDP

                                                                      ↳ UsableRulesProof

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ UsableRulesProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map1(y0, y1, Zero, y3) → new_map0(y0, Zero, Zero, Zero, y3)
new_map0(Succ(wy1870), wy198, wy199, Zero, ba) → new_map1(Succ(wy1870), wy198, wy199, ba)
new_map2(y0, y1, Zero, y3) → new_map0(y0, Zero, Zero, Zero, y3)
new_map0(Zero, wy198, wy199, Zero, ba) → new_map2(Zero, wy198, wy199, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ AND

                                                    ↳ QDP

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Narrowing

                                                                ↳ QDP

                                                                  ↳ DependencyGraphProof

                                                                    ↳ QDP

                                                                      ↳ UsableRulesProof

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ UsableRulesProof

                                                                                    ↳ QDP

                                                                                      ↳ QReductionProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map1(y0, y1, Zero, y3) → new_map0(y0, Zero, Zero, Zero, y3)
new_map0(Succ(wy1870), wy198, wy199, Zero, ba) → new_map1(Succ(wy1870), wy198, wy199, ba)
new_map2(y0, y1, Zero, y3) → new_map0(y0, Zero, Zero, Zero, y3)
new_map0(Zero, wy198, wy199, Zero, ba) → new_map2(Zero, wy198, wy199, ba)

R is empty.
The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ AND

                                                    ↳ QDP

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Narrowing

                                                                ↳ QDP

                                                                  ↳ DependencyGraphProof

                                                                    ↳ QDP

                                                                      ↳ UsableRulesProof

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ UsableRulesProof

                                                                                    ↳ QDP

                                                                                      ↳ QReductionProof

                                                                                        ↳ QDP

                                                                                          ↳ Instantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map1(y0, y1, Zero, y3) → new_map0(y0, Zero, Zero, Zero, y3)
new_map0(Succ(wy1870), wy198, wy199, Zero, ba) → new_map1(Succ(wy1870), wy198, wy199, ba)
new_map2(y0, y1, Zero, y3) → new_map0(y0, Zero, Zero, Zero, y3)
new_map0(Zero, wy198, wy199, Zero, ba) → new_map2(Zero, wy198, wy199, ba)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_map0(Succ(wy1870), wy198, wy199, Zero, ba) → new_map1(Succ(wy1870), wy198, wy199, ba) we obtained the following new rules:

new_map0(Succ(x0), Zero, Zero, Zero, z2) → new_map1(Succ(x0), Zero, Zero, z2)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ AND

                                                    ↳ QDP

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Narrowing

                                                                ↳ QDP

                                                                  ↳ DependencyGraphProof

                                                                    ↳ QDP

                                                                      ↳ UsableRulesProof

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ UsableRulesProof

                                                                                    ↳ QDP

                                                                                      ↳ QReductionProof

                                                                                        ↳ QDP

                                                                                          ↳ Instantiation

                                                                                            ↳ QDP

                                                                                              ↳ Instantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map0(Succ(x0), Zero, Zero, Zero, z2) → new_map1(Succ(x0), Zero, Zero, z2)
new_map1(y0, y1, Zero, y3) → new_map0(y0, Zero, Zero, Zero, y3)
new_map2(y0, y1, Zero, y3) → new_map0(y0, Zero, Zero, Zero, y3)
new_map0(Zero, wy198, wy199, Zero, ba) → new_map2(Zero, wy198, wy199, ba)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_map1(y0, y1, Zero, y3) → new_map0(y0, Zero, Zero, Zero, y3) we obtained the following new rules:

new_map1(Succ(z0), Zero, Zero, z1) → new_map0(Succ(z0), Zero, Zero, Zero, z1)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ AND

                                                    ↳ QDP

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Narrowing

                                                                ↳ QDP

                                                                  ↳ DependencyGraphProof

                                                                    ↳ QDP

                                                                      ↳ UsableRulesProof

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ UsableRulesProof

                                                                                    ↳ QDP

                                                                                      ↳ QReductionProof

                                                                                        ↳ QDP

                                                                                          ↳ Instantiation

                                                                                            ↳ QDP

                                                                                              ↳ Instantiation

                                                                                                ↳ QDP

                                                                                                  ↳ DependencyGraphProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map0(Succ(x0), Zero, Zero, Zero, z2) → new_map1(Succ(x0), Zero, Zero, z2)
new_map1(Succ(z0), Zero, Zero, z1) → new_map0(Succ(z0), Zero, Zero, Zero, z1)
new_map2(y0, y1, Zero, y3) → new_map0(y0, Zero, Zero, Zero, y3)
new_map0(Zero, wy198, wy199, Zero, ba) → new_map2(Zero, wy198, wy199, ba)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 2 SCCs.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ AND

                                                    ↳ QDP

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Narrowing

                                                                ↳ QDP

                                                                  ↳ DependencyGraphProof

                                                                    ↳ QDP

                                                                      ↳ UsableRulesProof

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ UsableRulesProof

                                                                                    ↳ QDP

                                                                                      ↳ QReductionProof

                                                                                        ↳ QDP

                                                                                          ↳ Instantiation

                                                                                            ↳ QDP

                                                                                              ↳ Instantiation

                                                                                                ↳ QDP

                                                                                                  ↳ DependencyGraphProof

                                                                                                    ↳ AND

                                                                                                      ↳ QDP

                                                                                                        ↳ NonTerminationProof

                                                                                                      ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map0(Succ(x0), Zero, Zero, Zero, z2) → new_map1(Succ(x0), Zero, Zero, z2)
new_map1(Succ(z0), Zero, Zero, z1) → new_map0(Succ(z0), Zero, Zero, Zero, z1)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We used the non-termination processor [17] to show that the DP problem is infinite.
Found a loop by narrowing to the left:

The TRS P consists of the following rules:

new_map0(Succ(x0), Zero, Zero, Zero, z2) → new_map1(Succ(x0), Zero, Zero, z2)
new_map1(Succ(z0), Zero, Zero, z1) → new_map0(Succ(z0), Zero, Zero, Zero, z1)

The TRS R consists of the following rules:none

s = new_map1(Succ(z0), Zero, Zero, z1) evaluates to t =new_map1(Succ(z0), Zero, Zero, z1)

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:

Semiunifier: [ ]
Matcher: [ ]

Rewriting sequence

new_map1(Succ(z0), Zero, Zero, z1) → new_map0(Succ(z0), Zero, Zero, Zero, z1)
with rule new_map1(Succ(z0'), Zero, Zero, z1') → new_map0(Succ(z0'), Zero, Zero, Zero, z1') at position [] and matcher [z1' / z1, z0' / z0]

new_map0(Succ(z0), Zero, Zero, Zero, z1) → new_map1(Succ(z0), Zero, Zero, z1)
with rule new_map0(Succ(x0), Zero, Zero, Zero, z2) → new_map1(Succ(x0), Zero, Zero, z2)

Now applying the matcher to the start term leads to a term which is equal to the last term in the rewriting sequence

All these steps are and every following step will be a correct step w.r.t to Q.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ AND

                                                    ↳ QDP

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Narrowing

                                                                ↳ QDP

                                                                  ↳ DependencyGraphProof

                                                                    ↳ QDP

                                                                      ↳ UsableRulesProof

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ UsableRulesProof

                                                                                    ↳ QDP

                                                                                      ↳ QReductionProof

                                                                                        ↳ QDP

                                                                                          ↳ Instantiation

                                                                                            ↳ QDP

                                                                                              ↳ Instantiation

                                                                                                ↳ QDP

                                                                                                  ↳ DependencyGraphProof

                                                                                                    ↳ AND

                                                                                                      ↳ QDP

                                                                                                      ↳ QDP

                                                                                                        ↳ Instantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map2(y0, y1, Zero, y3) → new_map0(y0, Zero, Zero, Zero, y3)
new_map0(Zero, wy198, wy199, Zero, ba) → new_map2(Zero, wy198, wy199, ba)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_map0(Zero, wy198, wy199, Zero, ba) → new_map2(Zero, wy198, wy199, ba) we obtained the following new rules:

new_map0(Zero, Zero, Zero, Zero, z2) → new_map2(Zero, Zero, Zero, z2)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ AND

                                                    ↳ QDP

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Narrowing

                                                                ↳ QDP

                                                                  ↳ DependencyGraphProof

                                                                    ↳ QDP

                                                                      ↳ UsableRulesProof

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ UsableRulesProof

                                                                                    ↳ QDP

                                                                                      ↳ QReductionProof

                                                                                        ↳ QDP

                                                                                          ↳ Instantiation

                                                                                            ↳ QDP

                                                                                              ↳ Instantiation

                                                                                                ↳ QDP

                                                                                                  ↳ DependencyGraphProof

                                                                                                    ↳ AND

                                                                                                      ↳ QDP

                                                                                                      ↳ QDP

                                                                                                        ↳ Instantiation

                                                                                                          ↳ QDP

                                                                                                            ↳ Instantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map2(y0, y1, Zero, y3) → new_map0(y0, Zero, Zero, Zero, y3)
new_map0(Zero, Zero, Zero, Zero, z2) → new_map2(Zero, Zero, Zero, z2)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_map2(y0, y1, Zero, y3) → new_map0(y0, Zero, Zero, Zero, y3) we obtained the following new rules:

new_map2(Zero, Zero, Zero, z0) → new_map0(Zero, Zero, Zero, Zero, z0)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ AND

                                                    ↳ QDP

                                                    ↳ QDP

                                                      ↳ Rewriting

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Narrowing

                                                                ↳ QDP

                                                                  ↳ DependencyGraphProof

                                                                    ↳ QDP

                                                                      ↳ UsableRulesProof

                                                                        ↳ QDP

                                                                          ↳ Rewriting

                                                                            ↳ QDP

                                                                              ↳ Rewriting

                                                                                ↳ QDP

                                                                                  ↳ UsableRulesProof

                                                                                    ↳ QDP

                                                                                      ↳ QReductionProof

                                                                                        ↳ QDP

                                                                                          ↳ Instantiation

                                                                                            ↳ QDP

                                                                                              ↳ Instantiation

                                                                                                ↳ QDP

                                                                                                  ↳ DependencyGraphProof

                                                                                                    ↳ AND

                                                                                                      ↳ QDP

                                                                                                      ↳ QDP

                                                                                                        ↳ Instantiation

                                                                                                          ↳ QDP

                                                                                                            ↳ Instantiation

                                                                                                              ↳ QDP

                                                                                                                ↳ NonTerminationProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map2(Zero, Zero, Zero, z0) → new_map0(Zero, Zero, Zero, Zero, z0)
new_map0(Zero, Zero, Zero, Zero, z2) → new_map2(Zero, Zero, Zero, z2)

The TRS R consists of the following rules:none

s = new_map0(Zero, Zero, Zero, Zero, z2) evaluates to t =new_map0(Zero, Zero, Zero, Zero, z2)

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:

Semiunifier: [ ]
Matcher: [ ]

Rewriting sequence

new_map0(Zero, Zero, Zero, Zero, z2) → new_map2(Zero, Zero, Zero, z2)
with rule new_map0(Zero, Zero, Zero, Zero, z2') → new_map2(Zero, Zero, Zero, z2') at position [] and matcher [z2' / z2]

new_map2(Zero, Zero, Zero, z2) → new_map0(Zero, Zero, Zero, Zero, z2)
with rule new_map2(Zero, Zero, Zero, z0) → new_map0(Zero, Zero, Zero, Zero, z0)

Now applying the matcher to the start term leads to a term which is equal to the last term in the rewriting sequence

All these steps are and every following step will be a correct step w.r.t to Q.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map5(wy443, wy444, wy445, wy446, ba) → new_map3(wy443, new_primPlusNat0(Succ(wy445), wy446), wy445, new_primPlusNat0(Succ(wy445), wy446), new_primPlusNat0(Succ(wy445), wy446), ba)
new_map3(wy443, wy450, wy445, wy451, Zero, ba) → new_map4(wy443, wy450, wy445, wy451, Succ(wy443), Zero, ba)
new_map4(wy443, wy444, wy445, wy446, Succ(wy4470), Zero, ba) → new_map3(wy443, new_primPlusNat0(Succ(wy445), wy446), wy445, new_primPlusNat0(Succ(wy445), wy446), new_primPlusNat0(Succ(wy445), wy446), ba)
new_map4(wy443, wy444, wy445, wy446, Zero, Zero, ba) → new_map5(wy443, wy444, wy445, wy446, ba)
new_map3(wy443, wy450, wy445, wy451, Succ(wy4520), ba) → new_map4(wy443, wy450, wy445, wy451, Succ(wy443), Succ(wy4520), ba)
new_map4(wy443, wy444, wy445, wy446, Succ(wy4470), Succ(wy4480), ba) → new_map4(wy443, wy444, wy445, wy446, wy4470, wy4480, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_map3(wy443, wy450, wy445, wy451, Zero, ba) → new_map4(wy443, wy450, wy445, wy451, Succ(wy443), Zero, ba)

The remaining pairs can at least be oriented weakly.

new_map5(wy443, wy444, wy445, wy446, ba) → new_map3(wy443, new_primPlusNat0(Succ(wy445), wy446), wy445, new_primPlusNat0(Succ(wy445), wy446), new_primPlusNat0(Succ(wy445), wy446), ba)
new_map4(wy443, wy444, wy445, wy446, Succ(wy4470), Zero, ba) → new_map3(wy443, new_primPlusNat0(Succ(wy445), wy446), wy445, new_primPlusNat0(Succ(wy445), wy446), new_primPlusNat0(Succ(wy445), wy446), ba)
new_map4(wy443, wy444, wy445, wy446, Zero, Zero, ba) → new_map5(wy443, wy444, wy445, wy446, ba)
new_map3(wy443, wy450, wy445, wy451, Succ(wy4520), ba) → new_map4(wy443, wy450, wy445, wy451, Succ(wy443), Succ(wy4520), ba)
new_map4(wy443, wy444, wy445, wy446, Succ(wy4470), Succ(wy4480), ba) → new_map4(wy443, wy444, wy445, wy446, wy4470, wy4480, ba)

Used ordering: Polynomial interpretation [25]:

POL(Succ(x₁)) = 0
POL(Zero) = 1
POL(new_map3(x₁, x₂, x₃, x₄, x₅, x₆)) = x₅
POL(new_map4(x₁, x₂, x₃, x₄, x₅, x₆, x₇)) = 0
POL(new_map5(x₁, x₂, x₃, x₄, x₅)) = 0
POL(new_primPlusNat0(x₁, x₂)) = x₁

The following usable rules [17] were oriented:

new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map5(wy443, wy444, wy445, wy446, ba) → new_map3(wy443, new_primPlusNat0(Succ(wy445), wy446), wy445, new_primPlusNat0(Succ(wy445), wy446), new_primPlusNat0(Succ(wy445), wy446), ba)
new_map4(wy443, wy444, wy445, wy446, Succ(wy4470), Zero, ba) → new_map3(wy443, new_primPlusNat0(Succ(wy445), wy446), wy445, new_primPlusNat0(Succ(wy445), wy446), new_primPlusNat0(Succ(wy445), wy446), ba)
new_map4(wy443, wy444, wy445, wy446, Zero, Zero, ba) → new_map5(wy443, wy444, wy445, wy446, ba)
new_map4(wy443, wy444, wy445, wy446, Succ(wy4470), Succ(wy4480), ba) → new_map4(wy443, wy444, wy445, wy446, wy4470, wy4480, ba)
new_map3(wy443, wy450, wy445, wy451, Succ(wy4520), ba) → new_map4(wy443, wy450, wy445, wy451, Succ(wy443), Succ(wy4520), ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule new_map5(wy443, wy444, wy445, wy446, ba) → new_map3(wy443, new_primPlusNat0(Succ(wy445), wy446), wy445, new_primPlusNat0(Succ(wy445), wy446), new_primPlusNat0(Succ(wy445), wy446), ba) at position [4] we obtained the following new rules:

new_map5(y0, y1, x0, Zero, y4) → new_map3(y0, new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y4)
new_map5(y0, y1, x0, Succ(x1), y4) → new_map3(y0, new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map4(wy443, wy444, wy445, wy446, Succ(wy4470), Zero, ba) → new_map3(wy443, new_primPlusNat0(Succ(wy445), wy446), wy445, new_primPlusNat0(Succ(wy445), wy446), new_primPlusNat0(Succ(wy445), wy446), ba)
new_map5(y0, y1, x0, Zero, y4) → new_map3(y0, new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y4)
new_map5(y0, y1, x0, Succ(x1), y4) → new_map3(y0, new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map4(wy443, wy444, wy445, wy446, Zero, Zero, ba) → new_map5(wy443, wy444, wy445, wy446, ba)
new_map3(wy443, wy450, wy445, wy451, Succ(wy4520), ba) → new_map4(wy443, wy450, wy445, wy451, Succ(wy443), Succ(wy4520), ba)
new_map4(wy443, wy444, wy445, wy446, Succ(wy4470), Succ(wy4480), ba) → new_map4(wy443, wy444, wy445, wy446, wy4470, wy4480, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map5(y0, y1, x0, Zero, y4) → new_map3(y0, new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y4) at position [1] we obtained the following new rules:

new_map5(y0, y1, x0, Zero, y4) → new_map3(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map5(y0, y1, x0, Zero, y4) → new_map3(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y4)
new_map4(wy443, wy444, wy445, wy446, Succ(wy4470), Zero, ba) → new_map3(wy443, new_primPlusNat0(Succ(wy445), wy446), wy445, new_primPlusNat0(Succ(wy445), wy446), new_primPlusNat0(Succ(wy445), wy446), ba)
new_map4(wy443, wy444, wy445, wy446, Zero, Zero, ba) → new_map5(wy443, wy444, wy445, wy446, ba)
new_map5(y0, y1, x0, Succ(x1), y4) → new_map3(y0, new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map4(wy443, wy444, wy445, wy446, Succ(wy4470), Succ(wy4480), ba) → new_map4(wy443, wy444, wy445, wy446, wy4470, wy4480, ba)
new_map3(wy443, wy450, wy445, wy451, Succ(wy4520), ba) → new_map4(wy443, wy450, wy445, wy451, Succ(wy443), Succ(wy4520), ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map5(y0, y1, x0, Succ(x1), y4) → new_map3(y0, new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y4) at position [1] we obtained the following new rules:

new_map5(y0, y1, x0, Succ(x1), y4) → new_map3(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map5(y0, y1, x0, Succ(x1), y4) → new_map3(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map5(y0, y1, x0, Zero, y4) → new_map3(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y4)
new_map4(wy443, wy444, wy445, wy446, Succ(wy4470), Zero, ba) → new_map3(wy443, new_primPlusNat0(Succ(wy445), wy446), wy445, new_primPlusNat0(Succ(wy445), wy446), new_primPlusNat0(Succ(wy445), wy446), ba)
new_map4(wy443, wy444, wy445, wy446, Zero, Zero, ba) → new_map5(wy443, wy444, wy445, wy446, ba)
new_map3(wy443, wy450, wy445, wy451, Succ(wy4520), ba) → new_map4(wy443, wy450, wy445, wy451, Succ(wy443), Succ(wy4520), ba)
new_map4(wy443, wy444, wy445, wy446, Succ(wy4470), Succ(wy4480), ba) → new_map4(wy443, wy444, wy445, wy446, wy4470, wy4480, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map5(y0, y1, x0, Zero, y4) → new_map3(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y4) at position [3] we obtained the following new rules:

new_map5(y0, y1, x0, Zero, y4) → new_map3(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map5(y0, y1, x0, Succ(x1), y4) → new_map3(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map4(wy443, wy444, wy445, wy446, Succ(wy4470), Zero, ba) → new_map3(wy443, new_primPlusNat0(Succ(wy445), wy446), wy445, new_primPlusNat0(Succ(wy445), wy446), new_primPlusNat0(Succ(wy445), wy446), ba)
new_map4(wy443, wy444, wy445, wy446, Zero, Zero, ba) → new_map5(wy443, wy444, wy445, wy446, ba)
new_map4(wy443, wy444, wy445, wy446, Succ(wy4470), Succ(wy4480), ba) → new_map4(wy443, wy444, wy445, wy446, wy4470, wy4480, ba)
new_map3(wy443, wy450, wy445, wy451, Succ(wy4520), ba) → new_map4(wy443, wy450, wy445, wy451, Succ(wy443), Succ(wy4520), ba)
new_map5(y0, y1, x0, Zero, y4) → new_map3(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map5(y0, y1, x0, Succ(x1), y4) → new_map3(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y4) at position [3] we obtained the following new rules:

new_map5(y0, y1, x0, Succ(x1), y4) → new_map3(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map4(wy443, wy444, wy445, wy446, Succ(wy4470), Zero, ba) → new_map3(wy443, new_primPlusNat0(Succ(wy445), wy446), wy445, new_primPlusNat0(Succ(wy445), wy446), new_primPlusNat0(Succ(wy445), wy446), ba)
new_map4(wy443, wy444, wy445, wy446, Zero, Zero, ba) → new_map5(wy443, wy444, wy445, wy446, ba)
new_map5(y0, y1, x0, Succ(x1), y4) → new_map3(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map3(wy443, wy450, wy445, wy451, Succ(wy4520), ba) → new_map4(wy443, wy450, wy445, wy451, Succ(wy443), Succ(wy4520), ba)
new_map4(wy443, wy444, wy445, wy446, Succ(wy4470), Succ(wy4480), ba) → new_map4(wy443, wy444, wy445, wy446, wy4470, wy4480, ba)
new_map5(y0, y1, x0, Zero, y4) → new_map3(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule new_map4(wy443, wy444, wy445, wy446, Succ(wy4470), Zero, ba) → new_map3(wy443, new_primPlusNat0(Succ(wy445), wy446), wy445, new_primPlusNat0(Succ(wy445), wy446), new_primPlusNat0(Succ(wy445), wy446), ba) at position [4] we obtained the following new rules:

new_map4(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map3(y0, new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5)
new_map4(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map3(y0, new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map4(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map3(y0, new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5)
new_map4(wy443, wy444, wy445, wy446, Zero, Zero, ba) → new_map5(wy443, wy444, wy445, wy446, ba)
new_map4(wy443, wy444, wy445, wy446, Succ(wy4470), Succ(wy4480), ba) → new_map4(wy443, wy444, wy445, wy446, wy4470, wy4480, ba)
new_map3(wy443, wy450, wy445, wy451, Succ(wy4520), ba) → new_map4(wy443, wy450, wy445, wy451, Succ(wy443), Succ(wy4520), ba)
new_map5(y0, y1, x0, Succ(x1), y4) → new_map3(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map4(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map3(y0, new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map5(y0, y1, x0, Zero, y4) → new_map3(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map4(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map3(y0, new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5) at position [1] we obtained the following new rules:

new_map4(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map3(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map4(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map3(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5)
new_map4(wy443, wy444, wy445, wy446, Zero, Zero, ba) → new_map5(wy443, wy444, wy445, wy446, ba)
new_map5(y0, y1, x0, Succ(x1), y4) → new_map3(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map3(wy443, wy450, wy445, wy451, Succ(wy4520), ba) → new_map4(wy443, wy450, wy445, wy451, Succ(wy443), Succ(wy4520), ba)
new_map4(wy443, wy444, wy445, wy446, Succ(wy4470), Succ(wy4480), ba) → new_map4(wy443, wy444, wy445, wy446, wy4470, wy4480, ba)
new_map5(y0, y1, x0, Zero, y4) → new_map3(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4)
new_map4(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map3(y0, new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map4(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map3(y0, new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5) at position [1] we obtained the following new rules:

new_map4(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map3(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map4(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map3(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map4(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map3(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5)
new_map4(wy443, wy444, wy445, wy446, Zero, Zero, ba) → new_map5(wy443, wy444, wy445, wy446, ba)
new_map4(wy443, wy444, wy445, wy446, Succ(wy4470), Succ(wy4480), ba) → new_map4(wy443, wy444, wy445, wy446, wy4470, wy4480, ba)
new_map3(wy443, wy450, wy445, wy451, Succ(wy4520), ba) → new_map4(wy443, wy450, wy445, wy451, Succ(wy443), Succ(wy4520), ba)
new_map5(y0, y1, x0, Succ(x1), y4) → new_map3(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map5(y0, y1, x0, Zero, y4) → new_map3(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map4(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map3(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5) at position [3] we obtained the following new rules:

new_map4(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map3(y0, Succ(x0), x0, Succ(x0), Succ(x0), y5)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map4(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map3(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map4(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map3(y0, Succ(x0), x0, Succ(x0), Succ(x0), y5)
new_map4(wy443, wy444, wy445, wy446, Zero, Zero, ba) → new_map5(wy443, wy444, wy445, wy446, ba)
new_map5(y0, y1, x0, Succ(x1), y4) → new_map3(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map3(wy443, wy450, wy445, wy451, Succ(wy4520), ba) → new_map4(wy443, wy450, wy445, wy451, Succ(wy443), Succ(wy4520), ba)
new_map4(wy443, wy444, wy445, wy446, Succ(wy4470), Succ(wy4480), ba) → new_map4(wy443, wy444, wy445, wy446, wy4470, wy4480, ba)
new_map5(y0, y1, x0, Zero, y4) → new_map3(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map4(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map3(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5) at position [3] we obtained the following new rules:

new_map4(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map3(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Instantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map4(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map3(y0, Succ(x0), x0, Succ(x0), Succ(x0), y5)
new_map4(wy443, wy444, wy445, wy446, Zero, Zero, ba) → new_map5(wy443, wy444, wy445, wy446, ba)
new_map4(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map3(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map4(wy443, wy444, wy445, wy446, Succ(wy4470), Succ(wy4480), ba) → new_map4(wy443, wy444, wy445, wy446, wy4470, wy4480, ba)
new_map3(wy443, wy450, wy445, wy451, Succ(wy4520), ba) → new_map4(wy443, wy450, wy445, wy451, Succ(wy443), Succ(wy4520), ba)
new_map5(y0, y1, x0, Succ(x1), y4) → new_map3(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map5(y0, y1, x0, Zero, y4) → new_map3(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_map3(wy443, wy450, wy445, wy451, Succ(wy4520), ba) → new_map4(wy443, wy450, wy445, wy451, Succ(wy443), Succ(wy4520), ba) we obtained the following new rules:

new_map3(z0, Succ(z2), z2, Succ(z2), Succ(z2), z3) → new_map4(z0, Succ(z2), z2, Succ(z2), Succ(z0), Succ(z2), z3)
new_map3(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z4) → new_map4(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(z0), Succ(Succ(y_2)), z4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ ForwardInstantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map3(z0, Succ(z2), z2, Succ(z2), Succ(z2), z3) → new_map4(z0, Succ(z2), z2, Succ(z2), Succ(z0), Succ(z2), z3)
new_map3(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z4) → new_map4(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(z0), Succ(Succ(y_2)), z4)
new_map4(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map3(y0, Succ(x0), x0, Succ(x0), Succ(x0), y5)
new_map4(wy443, wy444, wy445, wy446, Zero, Zero, ba) → new_map5(wy443, wy444, wy445, wy446, ba)
new_map5(y0, y1, x0, Succ(x1), y4) → new_map3(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map4(wy443, wy444, wy445, wy446, Succ(wy4470), Succ(wy4480), ba) → new_map4(wy443, wy444, wy445, wy446, wy4470, wy4480, ba)
new_map4(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map3(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map5(y0, y1, x0, Zero, y4) → new_map3(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map4(wy443, wy444, wy445, wy446, Zero, Zero, ba) → new_map5(wy443, wy444, wy445, wy446, ba) we obtained the following new rules:

new_map4(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map5(x0, x1, x2, Succ(y_3), x4)
new_map4(x0, x1, x2, Zero, Zero, Zero, x4) → new_map5(x0, x1, x2, Zero, x4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ ForwardInstantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map3(z0, Succ(z2), z2, Succ(z2), Succ(z2), z3) → new_map4(z0, Succ(z2), z2, Succ(z2), Succ(z0), Succ(z2), z3)
new_map4(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map5(x0, x1, x2, Succ(y_3), x4)
new_map3(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z4) → new_map4(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(z0), Succ(Succ(y_2)), z4)
new_map4(x0, x1, x2, Zero, Zero, Zero, x4) → new_map5(x0, x1, x2, Zero, x4)
new_map4(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map3(y0, Succ(x0), x0, Succ(x0), Succ(x0), y5)
new_map4(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map3(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map4(wy443, wy444, wy445, wy446, Succ(wy4470), Succ(wy4480), ba) → new_map4(wy443, wy444, wy445, wy446, wy4470, wy4480, ba)
new_map5(y0, y1, x0, Succ(x1), y4) → new_map3(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map5(y0, y1, x0, Zero, y4) → new_map3(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map4(wy443, wy444, wy445, wy446, Succ(wy4470), Succ(wy4480), ba) → new_map4(wy443, wy444, wy445, wy446, wy4470, wy4480, ba) we obtained the following new rules:

new_map4(x0, x1, x2, Zero, Succ(Succ(y_3)), Succ(Zero), x6) → new_map4(x0, x1, x2, Zero, Succ(y_3), Zero, x6)
new_map4(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Zero), x6) → new_map4(x0, x1, x2, Succ(y_3), Zero, Zero, x6)
new_map4(x0, x1, x2, Succ(y_3), Succ(Succ(y_4)), Succ(Zero), x6) → new_map4(x0, x1, x2, Succ(y_3), Succ(y_4), Zero, x6)
new_map4(x0, x1, x2, Zero, Succ(Zero), Succ(Zero), x6) → new_map4(x0, x1, x2, Zero, Zero, Zero, x6)
new_map4(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map4(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ ForwardInstantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map4(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map5(x0, x1, x2, Succ(y_3), x4)
new_map4(x0, x1, x2, Succ(y_3), Succ(Succ(y_4)), Succ(Zero), x6) → new_map4(x0, x1, x2, Succ(y_3), Succ(y_4), Zero, x6)
new_map3(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z4) → new_map4(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(z0), Succ(Succ(y_2)), z4)
new_map4(x0, x1, x2, Zero, Succ(Zero), Succ(Zero), x6) → new_map4(x0, x1, x2, Zero, Zero, Zero, x6)
new_map4(x0, x1, x2, Zero, Zero, Zero, x4) → new_map5(x0, x1, x2, Zero, x4)
new_map4(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map4(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map4(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map3(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map3(z0, Succ(z2), z2, Succ(z2), Succ(z2), z3) → new_map4(z0, Succ(z2), z2, Succ(z2), Succ(z0), Succ(z2), z3)
new_map4(x0, x1, x2, Zero, Succ(Succ(y_3)), Succ(Zero), x6) → new_map4(x0, x1, x2, Zero, Succ(y_3), Zero, x6)
new_map4(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Zero), x6) → new_map4(x0, x1, x2, Succ(y_3), Zero, Zero, x6)
new_map4(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map3(y0, Succ(x0), x0, Succ(x0), Succ(x0), y5)
new_map5(y0, y1, x0, Succ(x1), y4) → new_map3(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map5(y0, y1, x0, Zero, y4) → new_map3(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map3(z0, Succ(z2), z2, Succ(z2), Succ(z2), z3) → new_map4(z0, Succ(z2), z2, Succ(z2), Succ(z0), Succ(z2), z3) we obtained the following new rules:

new_map3(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map4(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2)
new_map3(Succ(y_4), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map4(Succ(y_4), Succ(Zero), Zero, Succ(Zero), Succ(Succ(y_4)), Succ(Zero), x2)
new_map3(Succ(y_4), Succ(Succ(y_5)), Succ(y_5), Succ(Succ(y_5)), Succ(Succ(y_5)), x2) → new_map4(Succ(y_4), Succ(Succ(y_5)), Succ(y_5), Succ(Succ(y_5)), Succ(Succ(y_4)), Succ(Succ(y_5)), x2)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ ForwardInstantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map4(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map5(x0, x1, x2, Succ(y_3), x4)
new_map4(x0, x1, x2, Succ(y_3), Succ(Succ(y_4)), Succ(Zero), x6) → new_map4(x0, x1, x2, Succ(y_3), Succ(y_4), Zero, x6)
new_map3(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z4) → new_map4(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(z0), Succ(Succ(y_2)), z4)
new_map4(x0, x1, x2, Zero, Succ(Zero), Succ(Zero), x6) → new_map4(x0, x1, x2, Zero, Zero, Zero, x6)
new_map4(x0, x1, x2, Zero, Zero, Zero, x4) → new_map5(x0, x1, x2, Zero, x4)
new_map4(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map4(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map3(Succ(y_4), Succ(Succ(y_5)), Succ(y_5), Succ(Succ(y_5)), Succ(Succ(y_5)), x2) → new_map4(Succ(y_4), Succ(Succ(y_5)), Succ(y_5), Succ(Succ(y_5)), Succ(Succ(y_4)), Succ(Succ(y_5)), x2)
new_map4(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map3(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map4(x0, x1, x2, Zero, Succ(Succ(y_3)), Succ(Zero), x6) → new_map4(x0, x1, x2, Zero, Succ(y_3), Zero, x6)
new_map3(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map4(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2)
new_map4(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Zero), x6) → new_map4(x0, x1, x2, Succ(y_3), Zero, Zero, x6)
new_map3(Succ(y_4), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map4(Succ(y_4), Succ(Zero), Zero, Succ(Zero), Succ(Succ(y_4)), Succ(Zero), x2)
new_map4(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map3(y0, Succ(x0), x0, Succ(x0), Succ(x0), y5)
new_map5(y0, y1, x0, Succ(x1), y4) → new_map3(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map5(y0, y1, x0, Zero, y4) → new_map3(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map5(y0, y1, x0, Zero, y4) → new_map3(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4) we obtained the following new rules:

new_map5(x0, x1, Succ(y_1), Zero, x3) → new_map3(x0, Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map5(Succ(y_0), x1, Succ(y_1), Zero, x3) → new_map3(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map5(Zero, x1, Zero, Zero, x3) → new_map3(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x3)
new_map5(Succ(y_0), x1, Zero, Zero, x3) → new_map3(Succ(y_0), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x3)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ ForwardInstantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map5(x0, x1, Succ(y_1), Zero, x3) → new_map3(x0, Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map4(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map5(x0, x1, x2, Succ(y_3), x4)
new_map5(Succ(y_0), x1, Succ(y_1), Zero, x3) → new_map3(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map4(x0, x1, x2, Succ(y_3), Succ(Succ(y_4)), Succ(Zero), x6) → new_map4(x0, x1, x2, Succ(y_3), Succ(y_4), Zero, x6)
new_map3(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z4) → new_map4(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(z0), Succ(Succ(y_2)), z4)
new_map4(x0, x1, x2, Zero, Succ(Zero), Succ(Zero), x6) → new_map4(x0, x1, x2, Zero, Zero, Zero, x6)
new_map4(x0, x1, x2, Zero, Zero, Zero, x4) → new_map5(x0, x1, x2, Zero, x4)
new_map4(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map4(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map5(Succ(y_0), x1, Zero, Zero, x3) → new_map3(Succ(y_0), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x3)
new_map3(Succ(y_4), Succ(Succ(y_5)), Succ(y_5), Succ(Succ(y_5)), Succ(Succ(y_5)), x2) → new_map4(Succ(y_4), Succ(Succ(y_5)), Succ(y_5), Succ(Succ(y_5)), Succ(Succ(y_4)), Succ(Succ(y_5)), x2)
new_map4(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map3(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map4(x0, x1, x2, Zero, Succ(Succ(y_3)), Succ(Zero), x6) → new_map4(x0, x1, x2, Zero, Succ(y_3), Zero, x6)
new_map4(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Zero), x6) → new_map4(x0, x1, x2, Succ(y_3), Zero, Zero, x6)
new_map3(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map4(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2)
new_map5(Zero, x1, Zero, Zero, x3) → new_map3(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x3)
new_map3(Succ(y_4), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map4(Succ(y_4), Succ(Zero), Zero, Succ(Zero), Succ(Succ(y_4)), Succ(Zero), x2)
new_map4(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map3(y0, Succ(x0), x0, Succ(x0), Succ(x0), y5)
new_map5(y0, y1, x0, Succ(x1), y4) → new_map3(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map4(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map3(y0, Succ(x0), x0, Succ(x0), Succ(x0), y5) we obtained the following new rules:

new_map4(Succ(y_0), x1, Succ(y_1), Zero, Succ(x3), Zero, x4) → new_map3(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x4)
new_map4(x0, x1, Succ(y_1), Zero, Succ(x3), Zero, x4) → new_map3(x0, Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x4)
new_map4(Zero, x1, Zero, Zero, Succ(x3), Zero, x4) → new_map3(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x4)
new_map4(Succ(y_0), x1, Zero, Zero, Succ(x3), Zero, x4) → new_map3(Succ(y_0), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ ForwardInstantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                                                                                      ↳ QDP

                                                                                        ↳ ForwardInstantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map5(x0, x1, Succ(y_1), Zero, x3) → new_map3(x0, Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map4(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map5(x0, x1, x2, Succ(y_3), x4)
new_map4(x0, x1, x2, Succ(y_3), Succ(Succ(y_4)), Succ(Zero), x6) → new_map4(x0, x1, x2, Succ(y_3), Succ(y_4), Zero, x6)
new_map5(Succ(y_0), x1, Succ(y_1), Zero, x3) → new_map3(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map4(Succ(y_0), x1, Succ(y_1), Zero, Succ(x3), Zero, x4) → new_map3(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x4)
new_map3(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z4) → new_map4(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(z0), Succ(Succ(y_2)), z4)
new_map4(x0, x1, x2, Zero, Succ(Zero), Succ(Zero), x6) → new_map4(x0, x1, x2, Zero, Zero, Zero, x6)
new_map4(x0, x1, x2, Zero, Zero, Zero, x4) → new_map5(x0, x1, x2, Zero, x4)
new_map4(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map4(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map5(Succ(y_0), x1, Zero, Zero, x3) → new_map3(Succ(y_0), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x3)
new_map4(Succ(y_0), x1, Zero, Zero, Succ(x3), Zero, x4) → new_map3(Succ(y_0), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x4)
new_map3(Succ(y_4), Succ(Succ(y_5)), Succ(y_5), Succ(Succ(y_5)), Succ(Succ(y_5)), x2) → new_map4(Succ(y_4), Succ(Succ(y_5)), Succ(y_5), Succ(Succ(y_5)), Succ(Succ(y_4)), Succ(Succ(y_5)), x2)
new_map4(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map3(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map4(x0, x1, x2, Zero, Succ(Succ(y_3)), Succ(Zero), x6) → new_map4(x0, x1, x2, Zero, Succ(y_3), Zero, x6)
new_map3(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map4(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2)
new_map4(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Zero), x6) → new_map4(x0, x1, x2, Succ(y_3), Zero, Zero, x6)
new_map3(Succ(y_4), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map4(Succ(y_4), Succ(Zero), Zero, Succ(Zero), Succ(Succ(y_4)), Succ(Zero), x2)
new_map5(Zero, x1, Zero, Zero, x3) → new_map3(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x3)
new_map4(x0, x1, Succ(y_1), Zero, Succ(x3), Zero, x4) → new_map3(x0, Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x4)
new_map4(Zero, x1, Zero, Zero, Succ(x3), Zero, x4) → new_map3(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x4)
new_map5(y0, y1, x0, Succ(x1), y4) → new_map3(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map3(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z4) → new_map4(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(z0), Succ(Succ(y_2)), z4) we obtained the following new rules:

new_map3(Succ(y_4), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map4(Succ(y_4), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(y_4)), Succ(Succ(x4)), x5)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ ForwardInstantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                                                                                      ↳ QDP

                                                                                        ↳ ForwardInstantiation

                                                                                          ↳ QDP

                                                                                            ↳ ForwardInstantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map5(x0, x1, Succ(y_1), Zero, x3) → new_map3(x0, Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map4(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map5(x0, x1, x2, Succ(y_3), x4)
new_map5(Succ(y_0), x1, Succ(y_1), Zero, x3) → new_map3(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map4(x0, x1, x2, Succ(y_3), Succ(Succ(y_4)), Succ(Zero), x6) → new_map4(x0, x1, x2, Succ(y_3), Succ(y_4), Zero, x6)
new_map4(Succ(y_0), x1, Succ(y_1), Zero, Succ(x3), Zero, x4) → new_map3(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x4)
new_map4(x0, x1, x2, Zero, Succ(Zero), Succ(Zero), x6) → new_map4(x0, x1, x2, Zero, Zero, Zero, x6)
new_map4(x0, x1, x2, Zero, Zero, Zero, x4) → new_map5(x0, x1, x2, Zero, x4)
new_map4(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map4(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map5(Succ(y_0), x1, Zero, Zero, x3) → new_map3(Succ(y_0), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x3)
new_map4(Succ(y_0), x1, Zero, Zero, Succ(x3), Zero, x4) → new_map3(Succ(y_0), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x4)
new_map3(Succ(y_4), Succ(Succ(y_5)), Succ(y_5), Succ(Succ(y_5)), Succ(Succ(y_5)), x2) → new_map4(Succ(y_4), Succ(Succ(y_5)), Succ(y_5), Succ(Succ(y_5)), Succ(Succ(y_4)), Succ(Succ(y_5)), x2)
new_map4(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map3(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map4(x0, x1, x2, Zero, Succ(Succ(y_3)), Succ(Zero), x6) → new_map4(x0, x1, x2, Zero, Succ(y_3), Zero, x6)
new_map4(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Zero), x6) → new_map4(x0, x1, x2, Succ(y_3), Zero, Zero, x6)
new_map3(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map4(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2)
new_map5(Zero, x1, Zero, Zero, x3) → new_map3(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x3)
new_map3(Succ(y_4), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map4(Succ(y_4), Succ(Zero), Zero, Succ(Zero), Succ(Succ(y_4)), Succ(Zero), x2)
new_map4(x0, x1, Succ(y_1), Zero, Succ(x3), Zero, x4) → new_map3(x0, Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x4)
new_map4(Zero, x1, Zero, Zero, Succ(x3), Zero, x4) → new_map3(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x4)
new_map3(Succ(y_4), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map4(Succ(y_4), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(y_4)), Succ(Succ(x4)), x5)
new_map5(y0, y1, x0, Succ(x1), y4) → new_map3(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map5(x0, x1, Succ(y_1), Zero, x3) → new_map3(x0, Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x3) we obtained the following new rules:

new_map5(Succ(y_0), x1, Succ(x2), Zero, x3) → new_map3(Succ(y_0), Succ(Succ(x2)), Succ(x2), Succ(Succ(x2)), Succ(Succ(x2)), x3)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ ForwardInstantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                                                                                      ↳ QDP

                                                                                        ↳ ForwardInstantiation

                                                                                          ↳ QDP

                                                                                            ↳ ForwardInstantiation

                                                                                              ↳ QDP

                                                                                                ↳ ForwardInstantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map4(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map5(x0, x1, x2, Succ(y_3), x4)
new_map4(x0, x1, x2, Succ(y_3), Succ(Succ(y_4)), Succ(Zero), x6) → new_map4(x0, x1, x2, Succ(y_3), Succ(y_4), Zero, x6)
new_map5(Succ(y_0), x1, Succ(y_1), Zero, x3) → new_map3(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map4(Succ(y_0), x1, Succ(y_1), Zero, Succ(x3), Zero, x4) → new_map3(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x4)
new_map4(x0, x1, x2, Zero, Succ(Zero), Succ(Zero), x6) → new_map4(x0, x1, x2, Zero, Zero, Zero, x6)
new_map4(x0, x1, x2, Zero, Zero, Zero, x4) → new_map5(x0, x1, x2, Zero, x4)
new_map4(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map4(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map5(Succ(y_0), x1, Zero, Zero, x3) → new_map3(Succ(y_0), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x3)
new_map4(Succ(y_0), x1, Zero, Zero, Succ(x3), Zero, x4) → new_map3(Succ(y_0), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x4)
new_map3(Succ(y_4), Succ(Succ(y_5)), Succ(y_5), Succ(Succ(y_5)), Succ(Succ(y_5)), x2) → new_map4(Succ(y_4), Succ(Succ(y_5)), Succ(y_5), Succ(Succ(y_5)), Succ(Succ(y_4)), Succ(Succ(y_5)), x2)
new_map4(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map3(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map4(x0, x1, x2, Zero, Succ(Succ(y_3)), Succ(Zero), x6) → new_map4(x0, x1, x2, Zero, Succ(y_3), Zero, x6)
new_map3(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map4(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2)
new_map4(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Zero), x6) → new_map4(x0, x1, x2, Succ(y_3), Zero, Zero, x6)
new_map3(Succ(y_4), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map4(Succ(y_4), Succ(Zero), Zero, Succ(Zero), Succ(Succ(y_4)), Succ(Zero), x2)
new_map5(Zero, x1, Zero, Zero, x3) → new_map3(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x3)
new_map4(x0, x1, Succ(y_1), Zero, Succ(x3), Zero, x4) → new_map3(x0, Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x4)
new_map4(Zero, x1, Zero, Zero, Succ(x3), Zero, x4) → new_map3(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x4)
new_map3(Succ(y_4), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map4(Succ(y_4), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(y_4)), Succ(Succ(x4)), x5)
new_map5(y0, y1, x0, Succ(x1), y4) → new_map3(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map4(x0, x1, Succ(y_1), Zero, Succ(x3), Zero, x4) → new_map3(x0, Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x4) we obtained the following new rules:

new_map4(Succ(y_0), x1, Succ(x2), Zero, Succ(x3), Zero, x4) → new_map3(Succ(y_0), Succ(Succ(x2)), Succ(x2), Succ(Succ(x2)), Succ(Succ(x2)), x4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ ForwardInstantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                                                                                      ↳ QDP

                                                                                        ↳ ForwardInstantiation

                                                                                          ↳ QDP

                                                                                            ↳ ForwardInstantiation

                                                                                              ↳ QDP

                                                                                                ↳ ForwardInstantiation

                                                                                                  ↳ QDP

                                                                                                    ↳ QDPOrderProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map4(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map5(x0, x1, x2, Succ(y_3), x4)
new_map5(Succ(y_0), x1, Succ(y_1), Zero, x3) → new_map3(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map4(x0, x1, x2, Succ(y_3), Succ(Succ(y_4)), Succ(Zero), x6) → new_map4(x0, x1, x2, Succ(y_3), Succ(y_4), Zero, x6)
new_map4(Succ(y_0), x1, Succ(y_1), Zero, Succ(x3), Zero, x4) → new_map3(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x4)
new_map4(x0, x1, x2, Zero, Succ(Zero), Succ(Zero), x6) → new_map4(x0, x1, x2, Zero, Zero, Zero, x6)
new_map4(x0, x1, x2, Zero, Zero, Zero, x4) → new_map5(x0, x1, x2, Zero, x4)
new_map4(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map4(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map5(Succ(y_0), x1, Zero, Zero, x3) → new_map3(Succ(y_0), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x3)
new_map4(Succ(y_0), x1, Zero, Zero, Succ(x3), Zero, x4) → new_map3(Succ(y_0), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x4)
new_map3(Succ(y_4), Succ(Succ(y_5)), Succ(y_5), Succ(Succ(y_5)), Succ(Succ(y_5)), x2) → new_map4(Succ(y_4), Succ(Succ(y_5)), Succ(y_5), Succ(Succ(y_5)), Succ(Succ(y_4)), Succ(Succ(y_5)), x2)
new_map4(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map3(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map4(x0, x1, x2, Zero, Succ(Succ(y_3)), Succ(Zero), x6) → new_map4(x0, x1, x2, Zero, Succ(y_3), Zero, x6)
new_map4(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Zero), x6) → new_map4(x0, x1, x2, Succ(y_3), Zero, Zero, x6)
new_map3(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map4(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2)
new_map5(Zero, x1, Zero, Zero, x3) → new_map3(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x3)
new_map3(Succ(y_4), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map4(Succ(y_4), Succ(Zero), Zero, Succ(Zero), Succ(Succ(y_4)), Succ(Zero), x2)
new_map4(Zero, x1, Zero, Zero, Succ(x3), Zero, x4) → new_map3(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x4)
new_map3(Succ(y_4), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map4(Succ(y_4), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(y_4)), Succ(Succ(x4)), x5)
new_map5(y0, y1, x0, Succ(x1), y4) → new_map3(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_map4(Succ(y_0), x1, Succ(y_1), Zero, Succ(x3), Zero, x4) → new_map3(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x4)
new_map4(x0, x1, x2, Zero, Zero, Zero, x4) → new_map5(x0, x1, x2, Zero, x4)
new_map4(Succ(y_0), x1, Zero, Zero, Succ(x3), Zero, x4) → new_map3(Succ(y_0), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x4)
new_map4(Zero, x1, Zero, Zero, Succ(x3), Zero, x4) → new_map3(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x4)

The remaining pairs can at least be oriented weakly.

new_map4(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map5(x0, x1, x2, Succ(y_3), x4)
new_map5(Succ(y_0), x1, Succ(y_1), Zero, x3) → new_map3(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map4(x0, x1, x2, Succ(y_3), Succ(Succ(y_4)), Succ(Zero), x6) → new_map4(x0, x1, x2, Succ(y_3), Succ(y_4), Zero, x6)
new_map4(x0, x1, x2, Zero, Succ(Zero), Succ(Zero), x6) → new_map4(x0, x1, x2, Zero, Zero, Zero, x6)
new_map4(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map4(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map5(Succ(y_0), x1, Zero, Zero, x3) → new_map3(Succ(y_0), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x3)
new_map3(Succ(y_4), Succ(Succ(y_5)), Succ(y_5), Succ(Succ(y_5)), Succ(Succ(y_5)), x2) → new_map4(Succ(y_4), Succ(Succ(y_5)), Succ(y_5), Succ(Succ(y_5)), Succ(Succ(y_4)), Succ(Succ(y_5)), x2)
new_map4(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map3(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map4(x0, x1, x2, Zero, Succ(Succ(y_3)), Succ(Zero), x6) → new_map4(x0, x1, x2, Zero, Succ(y_3), Zero, x6)
new_map4(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Zero), x6) → new_map4(x0, x1, x2, Succ(y_3), Zero, Zero, x6)
new_map3(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map4(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2)
new_map5(Zero, x1, Zero, Zero, x3) → new_map3(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x3)
new_map3(Succ(y_4), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map4(Succ(y_4), Succ(Zero), Zero, Succ(Zero), Succ(Succ(y_4)), Succ(Zero), x2)
new_map3(Succ(y_4), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map4(Succ(y_4), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(y_4)), Succ(Succ(x4)), x5)
new_map5(y0, y1, x0, Succ(x1), y4) → new_map3(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)

Used ordering: Polynomial interpretation [25]:

POL(Succ(x₁)) = 0
POL(Zero) = 1
POL(new_map3(x₁, x₂, x₃, x₄, x₅, x₆)) = 0
POL(new_map4(x₁, x₂, x₃, x₄, x₅, x₆, x₇)) = x₄
POL(new_map5(x₁, x₂, x₃, x₄, x₅)) = 0
POL(new_primPlusNat0(x₁, x₂)) = 0

The following usable rules [17] were oriented: none

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ ForwardInstantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                                                                                      ↳ QDP

                                                                                        ↳ ForwardInstantiation

                                                                                          ↳ QDP

                                                                                            ↳ ForwardInstantiation

                                                                                              ↳ QDP

                                                                                                ↳ ForwardInstantiation

                                                                                                  ↳ QDP

                                                                                                    ↳ QDPOrderProof

                                                                                                      ↳ QDP

                                                                                                        ↳ DependencyGraphProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map4(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map5(x0, x1, x2, Succ(y_3), x4)
new_map5(Succ(y_0), x1, Succ(y_1), Zero, x3) → new_map3(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map4(x0, x1, x2, Succ(y_3), Succ(Succ(y_4)), Succ(Zero), x6) → new_map4(x0, x1, x2, Succ(y_3), Succ(y_4), Zero, x6)
new_map4(x0, x1, x2, Zero, Succ(Zero), Succ(Zero), x6) → new_map4(x0, x1, x2, Zero, Zero, Zero, x6)
new_map4(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map4(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map5(Succ(y_0), x1, Zero, Zero, x3) → new_map3(Succ(y_0), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x3)
new_map3(Succ(y_4), Succ(Succ(y_5)), Succ(y_5), Succ(Succ(y_5)), Succ(Succ(y_5)), x2) → new_map4(Succ(y_4), Succ(Succ(y_5)), Succ(y_5), Succ(Succ(y_5)), Succ(Succ(y_4)), Succ(Succ(y_5)), x2)
new_map4(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map3(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map4(x0, x1, x2, Zero, Succ(Succ(y_3)), Succ(Zero), x6) → new_map4(x0, x1, x2, Zero, Succ(y_3), Zero, x6)
new_map4(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Zero), x6) → new_map4(x0, x1, x2, Succ(y_3), Zero, Zero, x6)
new_map3(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map4(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2)
new_map5(Zero, x1, Zero, Zero, x3) → new_map3(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x3)
new_map3(Succ(y_4), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map4(Succ(y_4), Succ(Zero), Zero, Succ(Zero), Succ(Succ(y_4)), Succ(Zero), x2)
new_map3(Succ(y_4), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map4(Succ(y_4), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(y_4)), Succ(Succ(x4)), x5)
new_map5(y0, y1, x0, Succ(x1), y4) → new_map3(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 7 less nodes.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ ForwardInstantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                                                                                      ↳ QDP

                                                                                        ↳ ForwardInstantiation

                                                                                          ↳ QDP

                                                                                            ↳ ForwardInstantiation

                                                                                              ↳ QDP

                                                                                                ↳ ForwardInstantiation

                                                                                                  ↳ QDP

                                                                                                    ↳ QDPOrderProof

                                                                                                      ↳ QDP

                                                                                                        ↳ DependencyGraphProof

                                                                                                          ↳ QDP

                                                                                                            ↳ MNOCProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map4(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map5(x0, x1, x2, Succ(y_3), x4)
new_map4(x0, x1, x2, Succ(y_3), Succ(Succ(y_4)), Succ(Zero), x6) → new_map4(x0, x1, x2, Succ(y_3), Succ(y_4), Zero, x6)
new_map4(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Zero), x6) → new_map4(x0, x1, x2, Succ(y_3), Zero, Zero, x6)
new_map4(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map4(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map3(Succ(y_4), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map4(Succ(y_4), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(y_4)), Succ(Succ(x4)), x5)
new_map3(Succ(y_4), Succ(Succ(y_5)), Succ(y_5), Succ(Succ(y_5)), Succ(Succ(y_5)), x2) → new_map4(Succ(y_4), Succ(Succ(y_5)), Succ(y_5), Succ(Succ(y_5)), Succ(Succ(y_4)), Succ(Succ(y_5)), x2)
new_map4(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map3(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map5(y0, y1, x0, Succ(x1), y4) → new_map3(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We use the modular non-overlap check [17] to decrease Q to the empty set.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ ForwardInstantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                                                                                      ↳ QDP

                                                                                        ↳ ForwardInstantiation

                                                                                          ↳ QDP

                                                                                            ↳ ForwardInstantiation

                                                                                              ↳ QDP

                                                                                                ↳ ForwardInstantiation

                                                                                                  ↳ QDP

                                                                                                    ↳ QDPOrderProof

                                                                                                      ↳ QDP

                                                                                                        ↳ DependencyGraphProof

                                                                                                          ↳ QDP

                                                                                                            ↳ MNOCProof

                                                                                                              ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map4(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map5(x0, x1, x2, Succ(y_3), x4)
new_map4(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Zero), x6) → new_map4(x0, x1, x2, Succ(y_3), Zero, Zero, x6)
new_map4(x0, x1, x2, Succ(y_3), Succ(Succ(y_4)), Succ(Zero), x6) → new_map4(x0, x1, x2, Succ(y_3), Succ(y_4), Zero, x6)
new_map4(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map4(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map3(Succ(y_4), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map4(Succ(y_4), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(y_4)), Succ(Succ(x4)), x5)
new_map3(Succ(y_4), Succ(Succ(y_5)), Succ(y_5), Succ(Succ(y_5)), Succ(Succ(y_5)), x2) → new_map4(Succ(y_4), Succ(Succ(y_5)), Succ(y_5), Succ(Succ(y_5)), Succ(Succ(y_4)), Succ(Succ(y_5)), x2)
new_map5(y0, y1, x0, Succ(x1), y4) → new_map3(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map4(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map3(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

Q is empty.
We have to consider all (P,Q,R)-chains.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ Instantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map6(wy187, wy195, wy1880, wy196, Succ(wy1970), ba) → new_map6(wy187, new_primPlusNat0(Succ(wy1880), wy196), wy1880, new_primPlusNat0(Succ(wy1880), wy196), new_primPlusNat0(Succ(wy1880), wy196), ba)
new_map7(wy187, wy195, wy1880, wy196, ba) → new_map6(wy187, new_primPlusNat0(Succ(wy1880), wy196), wy1880, new_primPlusNat0(Succ(wy1880), wy196), new_primPlusNat0(Succ(wy1880), wy196), ba)
new_map6(Zero, wy195, wy1880, wy196, Zero, ba) → new_map8(Zero, wy195, wy1880, wy196, ba)
new_map6(Succ(wy1870), wy195, wy1880, wy196, Zero, ba) → new_map7(Succ(wy1870), wy195, wy1880, wy196, ba)
new_map8(wy187, wy195, wy1880, wy196, ba) → new_map6(wy187, new_primPlusNat0(Succ(wy1880), wy196), wy1880, new_primPlusNat0(Succ(wy1880), wy196), new_primPlusNat0(Succ(wy1880), wy196), ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_map8(wy187, wy195, wy1880, wy196, ba) → new_map6(wy187, new_primPlusNat0(Succ(wy1880), wy196), wy1880, new_primPlusNat0(Succ(wy1880), wy196), new_primPlusNat0(Succ(wy1880), wy196), ba) we obtained the following new rules:

new_map8(Zero, z0, z1, z2, z3) → new_map6(Zero, new_primPlusNat0(Succ(z1), z2), z1, new_primPlusNat0(Succ(z1), z2), new_primPlusNat0(Succ(z1), z2), z3)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ Instantiation

                      ↳ QDP

                        ↳ QDPOrderProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map7(wy187, wy195, wy1880, wy196, ba) → new_map6(wy187, new_primPlusNat0(Succ(wy1880), wy196), wy1880, new_primPlusNat0(Succ(wy1880), wy196), new_primPlusNat0(Succ(wy1880), wy196), ba)
new_map6(wy187, wy195, wy1880, wy196, Succ(wy1970), ba) → new_map6(wy187, new_primPlusNat0(Succ(wy1880), wy196), wy1880, new_primPlusNat0(Succ(wy1880), wy196), new_primPlusNat0(Succ(wy1880), wy196), ba)
new_map6(Zero, wy195, wy1880, wy196, Zero, ba) → new_map8(Zero, wy195, wy1880, wy196, ba)
new_map8(Zero, z0, z1, z2, z3) → new_map6(Zero, new_primPlusNat0(Succ(z1), z2), z1, new_primPlusNat0(Succ(z1), z2), new_primPlusNat0(Succ(z1), z2), z3)
new_map6(Succ(wy1870), wy195, wy1880, wy196, Zero, ba) → new_map7(Succ(wy1870), wy195, wy1880, wy196, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_map6(Zero, wy195, wy1880, wy196, Zero, ba) → new_map8(Zero, wy195, wy1880, wy196, ba)
new_map6(Succ(wy1870), wy195, wy1880, wy196, Zero, ba) → new_map7(Succ(wy1870), wy195, wy1880, wy196, ba)

The remaining pairs can at least be oriented weakly.

new_map7(wy187, wy195, wy1880, wy196, ba) → new_map6(wy187, new_primPlusNat0(Succ(wy1880), wy196), wy1880, new_primPlusNat0(Succ(wy1880), wy196), new_primPlusNat0(Succ(wy1880), wy196), ba)
new_map6(wy187, wy195, wy1880, wy196, Succ(wy1970), ba) → new_map6(wy187, new_primPlusNat0(Succ(wy1880), wy196), wy1880, new_primPlusNat0(Succ(wy1880), wy196), new_primPlusNat0(Succ(wy1880), wy196), ba)
new_map8(Zero, z0, z1, z2, z3) → new_map6(Zero, new_primPlusNat0(Succ(z1), z2), z1, new_primPlusNat0(Succ(z1), z2), new_primPlusNat0(Succ(z1), z2), z3)

Used ordering: Polynomial interpretation [25]:

POL(Succ(x₁)) = 0
POL(Zero) = 1
POL(new_map6(x₁, x₂, x₃, x₄, x₅, x₆)) = x₁ + x₅
POL(new_map7(x₁, x₂, x₃, x₄, x₅)) = x₁
POL(new_map8(x₁, x₂, x₃, x₄, x₅)) = x₁
POL(new_primPlusNat0(x₁, x₂)) = 0

The following usable rules [17] were oriented:

new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ Instantiation

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ DependencyGraphProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map6(wy187, wy195, wy1880, wy196, Succ(wy1970), ba) → new_map6(wy187, new_primPlusNat0(Succ(wy1880), wy196), wy1880, new_primPlusNat0(Succ(wy1880), wy196), new_primPlusNat0(Succ(wy1880), wy196), ba)
new_map7(wy187, wy195, wy1880, wy196, ba) → new_map6(wy187, new_primPlusNat0(Succ(wy1880), wy196), wy1880, new_primPlusNat0(Succ(wy1880), wy196), new_primPlusNat0(Succ(wy1880), wy196), ba)
new_map8(Zero, z0, z1, z2, z3) → new_map6(Zero, new_primPlusNat0(Succ(z1), z2), z1, new_primPlusNat0(Succ(z1), z2), new_primPlusNat0(Succ(z1), z2), z3)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 2 less nodes.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ Instantiation

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map6(wy187, wy195, wy1880, wy196, Succ(wy1970), ba) → new_map6(wy187, new_primPlusNat0(Succ(wy1880), wy196), wy1880, new_primPlusNat0(Succ(wy1880), wy196), new_primPlusNat0(Succ(wy1880), wy196), ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule new_map6(wy187, wy195, wy1880, wy196, Succ(wy1970), ba) → new_map6(wy187, new_primPlusNat0(Succ(wy1880), wy196), wy1880, new_primPlusNat0(Succ(wy1880), wy196), new_primPlusNat0(Succ(wy1880), wy196), ba) at position [4] we obtained the following new rules:

new_map6(y0, y1, x0, Zero, Succ(y4), y5) → new_map6(y0, new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5)
new_map6(y0, y1, x0, Succ(x1), Succ(y4), y5) → new_map6(y0, new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ Instantiation

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map6(y0, y1, x0, Succ(x1), Succ(y4), y5) → new_map6(y0, new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map6(y0, y1, x0, Zero, Succ(y4), y5) → new_map6(y0, new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map6(y0, y1, x0, Zero, Succ(y4), y5) → new_map6(y0, new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5) at position [1] we obtained the following new rules:

new_map6(y0, y1, x0, Zero, Succ(y4), y5) → new_map6(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ Instantiation

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map6(y0, y1, x0, Succ(x1), Succ(y4), y5) → new_map6(y0, new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map6(y0, y1, x0, Zero, Succ(y4), y5) → new_map6(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map6(y0, y1, x0, Succ(x1), Succ(y4), y5) → new_map6(y0, new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5) at position [1] we obtained the following new rules:

new_map6(y0, y1, x0, Succ(x1), Succ(y4), y5) → new_map6(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ Instantiation

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map6(y0, y1, x0, Succ(x1), Succ(y4), y5) → new_map6(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map6(y0, y1, x0, Zero, Succ(y4), y5) → new_map6(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map6(y0, y1, x0, Zero, Succ(y4), y5) → new_map6(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5) at position [3] we obtained the following new rules:

new_map6(y0, y1, x0, Zero, Succ(y4), y5) → new_map6(y0, Succ(x0), x0, Succ(x0), Succ(x0), y5)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ Instantiation

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map6(y0, y1, x0, Succ(x1), Succ(y4), y5) → new_map6(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map6(y0, y1, x0, Zero, Succ(y4), y5) → new_map6(y0, Succ(x0), x0, Succ(x0), Succ(x0), y5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map6(y0, y1, x0, Succ(x1), Succ(y4), y5) → new_map6(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5) at position [3] we obtained the following new rules:

new_map6(y0, y1, x0, Succ(x1), Succ(y4), y5) → new_map6(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ Instantiation

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ DependencyGraphProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map6(y0, y1, x0, Zero, Succ(y4), y5) → new_map6(y0, Succ(x0), x0, Succ(x0), Succ(x0), y5)
new_map6(y0, y1, x0, Succ(x1), Succ(y4), y5) → new_map6(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ Instantiation

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ DependencyGraphProof

                                                      ↳ QDP

                                                        ↳ Instantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map6(y0, y1, x0, Succ(x1), Succ(y4), y5) → new_map6(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_map6(y0, y1, x0, Succ(x1), Succ(y4), y5) → new_map6(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5) we obtained the following new rules:

new_map6(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z5) → new_map6(z0, Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), z2, Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), z5)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ Instantiation

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ DependencyGraphProof

                                                      ↳ QDP

                                                        ↳ Instantiation

                                                          ↳ QDP

                                                            ↳ MNOCProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map6(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z5) → new_map6(z0, Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), z2, Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), z5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We use the modular non-overlap check [17] to decrease Q to the empty set.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ Instantiation

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ DependencyGraphProof

                                                      ↳ QDP

                                                        ↳ Instantiation

                                                          ↳ QDP

                                                            ↳ MNOCProof

                                                              ↳ QDP

                                                                ↳ NonTerminationProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map6(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z5) → new_map6(z0, Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), z2, Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), z5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

Q is empty.
We have to consider all (P,Q,R)-chains.
We used the non-termination processor [17] to show that the DP problem is infinite.
Found a loop by semiunifying a rule from P directly.

The TRS P consists of the following rules:

new_map6(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z5) → new_map6(z0, Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), z2, Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), z5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

s = new_map6(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z5) evaluates to t =new_map6(z0, Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), z2, Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), z5)

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:

Matcher: [y_2 / new_primPlusNat0(z2, Succ(y_1)), y_1 / new_primPlusNat0(z2, Succ(y_1)), y_0 / new_primPlusNat0(z2, Succ(y_1))]
Semiunifier: [ ]

Rewriting sequence

The DP semiunifies directly so there is only one rewrite step from new_map6(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z5) to new_map6(z0, Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), z2, Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), z5).

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map10(wy204, wy205, ba) → new_map9(new_primPlusNat0(Zero, wy205), new_primPlusNat0(Zero, wy205), new_primPlusNat0(Zero, wy205), ba)
new_map9(wy204, wy205, Succ(wy2060), ba) → new_map10(wy204, wy205, ba)
new_map9(wy204, wy205, Zero, ba) → new_map9(new_primPlusNat0(Zero, wy205), new_primPlusNat0(Zero, wy205), new_primPlusNat0(Zero, wy205), ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map10(wy204, wy205, ba) → new_map9(new_primPlusNat0(Zero, wy205), new_primPlusNat0(Zero, wy205), new_primPlusNat0(Zero, wy205), ba)
new_map9(wy204, wy205, Succ(wy2060), ba) → new_map10(wy204, wy205, ba)
new_map9(wy204, wy205, Zero, ba) → new_map9(new_primPlusNat0(Zero, wy205), new_primPlusNat0(Zero, wy205), new_primPlusNat0(Zero, wy205), ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule new_map10(wy204, wy205, ba) → new_map9(new_primPlusNat0(Zero, wy205), new_primPlusNat0(Zero, wy205), new_primPlusNat0(Zero, wy205), ba) at position [2] we obtained the following new rules:

new_map10(y0, Succ(x0), y2) → new_map9(new_primPlusNat0(Zero, Succ(x0)), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y2)
new_map10(y0, Zero, y2) → new_map9(new_primPlusNat0(Zero, Zero), new_primPlusNat0(Zero, Zero), Zero, y2)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map9(wy204, wy205, Succ(wy2060), ba) → new_map10(wy204, wy205, ba)
new_map10(y0, Zero, y2) → new_map9(new_primPlusNat0(Zero, Zero), new_primPlusNat0(Zero, Zero), Zero, y2)
new_map10(y0, Succ(x0), y2) → new_map9(new_primPlusNat0(Zero, Succ(x0)), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y2)
new_map9(wy204, wy205, Zero, ba) → new_map9(new_primPlusNat0(Zero, wy205), new_primPlusNat0(Zero, wy205), new_primPlusNat0(Zero, wy205), ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map10(y0, Succ(x0), y2) → new_map9(new_primPlusNat0(Zero, Succ(x0)), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y2) at position [0] we obtained the following new rules:

new_map10(y0, Succ(x0), y2) → new_map9(Succ(x0), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y2)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map9(wy204, wy205, Succ(wy2060), ba) → new_map10(wy204, wy205, ba)
new_map10(y0, Succ(x0), y2) → new_map9(Succ(x0), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y2)
new_map9(wy204, wy205, Zero, ba) → new_map9(new_primPlusNat0(Zero, wy205), new_primPlusNat0(Zero, wy205), new_primPlusNat0(Zero, wy205), ba)
new_map10(y0, Zero, y2) → new_map9(new_primPlusNat0(Zero, Zero), new_primPlusNat0(Zero, Zero), Zero, y2)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map10(y0, Zero, y2) → new_map9(new_primPlusNat0(Zero, Zero), new_primPlusNat0(Zero, Zero), Zero, y2) at position [0] we obtained the following new rules:

new_map10(y0, Zero, y2) → new_map9(Zero, new_primPlusNat0(Zero, Zero), Zero, y2)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map9(wy204, wy205, Succ(wy2060), ba) → new_map10(wy204, wy205, ba)
new_map10(y0, Succ(x0), y2) → new_map9(Succ(x0), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y2)
new_map9(wy204, wy205, Zero, ba) → new_map9(new_primPlusNat0(Zero, wy205), new_primPlusNat0(Zero, wy205), new_primPlusNat0(Zero, wy205), ba)
new_map10(y0, Zero, y2) → new_map9(Zero, new_primPlusNat0(Zero, Zero), Zero, y2)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map10(y0, Succ(x0), y2) → new_map9(Succ(x0), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y2) at position [1] we obtained the following new rules:

new_map10(y0, Succ(x0), y2) → new_map9(Succ(x0), Succ(x0), Succ(x0), y2)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map9(wy204, wy205, Succ(wy2060), ba) → new_map10(wy204, wy205, ba)
new_map10(y0, Succ(x0), y2) → new_map9(Succ(x0), Succ(x0), Succ(x0), y2)
new_map9(wy204, wy205, Zero, ba) → new_map9(new_primPlusNat0(Zero, wy205), new_primPlusNat0(Zero, wy205), new_primPlusNat0(Zero, wy205), ba)
new_map10(y0, Zero, y2) → new_map9(Zero, new_primPlusNat0(Zero, Zero), Zero, y2)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map10(y0, Zero, y2) → new_map9(Zero, new_primPlusNat0(Zero, Zero), Zero, y2) at position [1] we obtained the following new rules:

new_map10(y0, Zero, y2) → new_map9(Zero, Zero, Zero, y2)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map9(wy204, wy205, Succ(wy2060), ba) → new_map10(wy204, wy205, ba)
new_map10(y0, Succ(x0), y2) → new_map9(Succ(x0), Succ(x0), Succ(x0), y2)
new_map9(wy204, wy205, Zero, ba) → new_map9(new_primPlusNat0(Zero, wy205), new_primPlusNat0(Zero, wy205), new_primPlusNat0(Zero, wy205), ba)
new_map10(y0, Zero, y2) → new_map9(Zero, Zero, Zero, y2)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule new_map9(wy204, wy205, Zero, ba) → new_map9(new_primPlusNat0(Zero, wy205), new_primPlusNat0(Zero, wy205), new_primPlusNat0(Zero, wy205), ba) at position [2] we obtained the following new rules:

new_map9(y0, Succ(x0), Zero, y2) → new_map9(new_primPlusNat0(Zero, Succ(x0)), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y2)
new_map9(y0, Zero, Zero, y2) → new_map9(new_primPlusNat0(Zero, Zero), new_primPlusNat0(Zero, Zero), Zero, y2)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map9(wy204, wy205, Succ(wy2060), ba) → new_map10(wy204, wy205, ba)
new_map9(y0, Zero, Zero, y2) → new_map9(new_primPlusNat0(Zero, Zero), new_primPlusNat0(Zero, Zero), Zero, y2)
new_map10(y0, Succ(x0), y2) → new_map9(Succ(x0), Succ(x0), Succ(x0), y2)
new_map9(y0, Succ(x0), Zero, y2) → new_map9(new_primPlusNat0(Zero, Succ(x0)), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y2)
new_map10(y0, Zero, y2) → new_map9(Zero, Zero, Zero, y2)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 2 SCCs with 2 less nodes.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ AND

                                                    ↳ QDP

                                                      ↳ UsableRulesProof

                                                    ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map9(y0, Zero, Zero, y2) → new_map9(new_primPlusNat0(Zero, Zero), new_primPlusNat0(Zero, Zero), Zero, y2)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ AND

                                                    ↳ QDP

                                                      ↳ UsableRulesProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                    ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map9(y0, Zero, Zero, y2) → new_map9(new_primPlusNat0(Zero, Zero), new_primPlusNat0(Zero, Zero), Zero, y2)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map9(y0, Zero, Zero, y2) → new_map9(new_primPlusNat0(Zero, Zero), new_primPlusNat0(Zero, Zero), Zero, y2) at position [0] we obtained the following new rules:

new_map9(y0, Zero, Zero, y2) → new_map9(Zero, new_primPlusNat0(Zero, Zero), Zero, y2)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ AND

                                                    ↳ QDP

                                                      ↳ UsableRulesProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                    ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map9(y0, Zero, Zero, y2) → new_map9(Zero, new_primPlusNat0(Zero, Zero), Zero, y2)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map9(y0, Zero, Zero, y2) → new_map9(Zero, new_primPlusNat0(Zero, Zero), Zero, y2) at position [1] we obtained the following new rules:

new_map9(y0, Zero, Zero, y2) → new_map9(Zero, Zero, Zero, y2)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ AND

                                                    ↳ QDP

                                                      ↳ UsableRulesProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ UsableRulesProof

                                                    ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map9(y0, Zero, Zero, y2) → new_map9(Zero, Zero, Zero, y2)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ AND

                                                    ↳ QDP

                                                      ↳ UsableRulesProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ UsableRulesProof

                                                                    ↳ QDP

                                                                      ↳ QReductionProof

                                                    ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map9(y0, Zero, Zero, y2) → new_map9(Zero, Zero, Zero, y2)

R is empty.
The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ AND

                                                    ↳ QDP

                                                      ↳ UsableRulesProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ UsableRulesProof

                                                                    ↳ QDP

                                                                      ↳ QReductionProof

                                                                        ↳ QDP

                                                                          ↳ Instantiation

                                                    ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map9(y0, Zero, Zero, y2) → new_map9(Zero, Zero, Zero, y2)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_map9(y0, Zero, Zero, y2) → new_map9(Zero, Zero, Zero, y2) we obtained the following new rules:

new_map9(Zero, Zero, Zero, z1) → new_map9(Zero, Zero, Zero, z1)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ AND

                                                    ↳ QDP

                                                      ↳ UsableRulesProof

                                                        ↳ QDP

                                                          ↳ Rewriting

                                                            ↳ QDP

                                                              ↳ Rewriting

                                                                ↳ QDP

                                                                  ↳ UsableRulesProof

                                                                    ↳ QDP

                                                                      ↳ QReductionProof

                                                                        ↳ QDP

                                                                          ↳ Instantiation

                                                                            ↳ QDP

                                                                              ↳ NonTerminationProof

                                                    ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map9(Zero, Zero, Zero, z1) → new_map9(Zero, Zero, Zero, z1)

The TRS R consists of the following rules:none

s = new_map9(Zero, Zero, Zero, z1) evaluates to t =new_map9(Zero, Zero, Zero, z1)

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:

Semiunifier: [ ]
Matcher: [ ]

Rewriting sequence

The DP semiunifies directly so there is only one rewrite step from new_map9(Zero, Zero, Zero, z1) to new_map9(Zero, Zero, Zero, z1).

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ AND

                                                    ↳ QDP

                                                    ↳ QDP

                                                      ↳ UsableRulesProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map9(wy204, wy205, Succ(wy2060), ba) → new_map10(wy204, wy205, ba)
new_map10(y0, Succ(x0), y2) → new_map9(Succ(x0), Succ(x0), Succ(x0), y2)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ AND

                                                    ↳ QDP

                                                    ↳ QDP

                                                      ↳ UsableRulesProof

                                                        ↳ QDP

                                                          ↳ QReductionProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map9(wy204, wy205, Succ(wy2060), ba) → new_map10(wy204, wy205, ba)
new_map10(y0, Succ(x0), y2) → new_map9(Succ(x0), Succ(x0), Succ(x0), y2)

R is empty.
The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ AND

                                                    ↳ QDP

                                                    ↳ QDP

                                                      ↳ UsableRulesProof

                                                        ↳ QDP

                                                          ↳ QReductionProof

                                                            ↳ QDP

                                                              ↳ Instantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map9(wy204, wy205, Succ(wy2060), ba) → new_map10(wy204, wy205, ba)
new_map10(y0, Succ(x0), y2) → new_map9(Succ(x0), Succ(x0), Succ(x0), y2)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_map9(wy204, wy205, Succ(wy2060), ba) → new_map10(wy204, wy205, ba) we obtained the following new rules:

new_map9(Succ(z1), Succ(z1), Succ(z1), z2) → new_map10(Succ(z1), Succ(z1), z2)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ AND

                                                    ↳ QDP

                                                    ↳ QDP

                                                      ↳ UsableRulesProof

                                                        ↳ QDP

                                                          ↳ QReductionProof

                                                            ↳ QDP

                                                              ↳ Instantiation

                                                                ↳ QDP

                                                                  ↳ Instantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map10(y0, Succ(x0), y2) → new_map9(Succ(x0), Succ(x0), Succ(x0), y2)
new_map9(Succ(z1), Succ(z1), Succ(z1), z2) → new_map10(Succ(z1), Succ(z1), z2)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_map10(y0, Succ(x0), y2) → new_map9(Succ(x0), Succ(x0), Succ(x0), y2) we obtained the following new rules:

new_map10(Succ(z0), Succ(z0), z1) → new_map9(Succ(z0), Succ(z0), Succ(z0), z1)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ AND

                                                    ↳ QDP

                                                    ↳ QDP

                                                      ↳ UsableRulesProof

                                                        ↳ QDP

                                                          ↳ QReductionProof

                                                            ↳ QDP

                                                              ↳ Instantiation

                                                                ↳ QDP

                                                                  ↳ Instantiation

                                                                    ↳ QDP

                                                                      ↳ NonTerminationProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map10(Succ(z0), Succ(z0), z1) → new_map9(Succ(z0), Succ(z0), Succ(z0), z1)
new_map9(Succ(z1), Succ(z1), Succ(z1), z2) → new_map10(Succ(z1), Succ(z1), z2)

The TRS R consists of the following rules:none

s = new_map9(Succ(z1'), Succ(z1'), Succ(z1'), z2) evaluates to t =new_map9(Succ(z1'), Succ(z1'), Succ(z1'), z2)

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:

Semiunifier: [ ]
Matcher: [ ]

Rewriting sequence

new_map9(Succ(z1'), Succ(z1'), Succ(z1'), z2) → new_map10(Succ(z1'), Succ(z1'), z2)
with rule new_map9(Succ(z1''), Succ(z1''), Succ(z1''), z2') → new_map10(Succ(z1''), Succ(z1''), z2') at position [] and matcher [z2' / z2, z1'' / z1']

new_map10(Succ(z1'), Succ(z1'), z2) → new_map9(Succ(z1'), Succ(z1'), Succ(z1'), z2)
with rule new_map10(Succ(z0), Succ(z0), z1) → new_map9(Succ(z0), Succ(z0), Succ(z0), z1)

Now applying the matcher to the start term leads to a term which is equal to the last term in the rewriting sequence

All these steps are and every following step will be a correct step w.r.t to Q.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map11(wy201, wy1920, wy202, Zero, ba) → new_map11(new_primPlusNat0(Succ(wy1920), wy202), wy1920, new_primPlusNat0(Succ(wy1920), wy202), new_primPlusNat0(Succ(wy1920), wy202), ba)
new_map11(wy201, wy1920, wy202, Succ(wy2030), ba) → new_map12(wy201, wy1920, wy202, ba)
new_map12(wy201, wy1920, wy202, ba) → new_map11(new_primPlusNat0(Succ(wy1920), wy202), wy1920, new_primPlusNat0(Succ(wy1920), wy202), new_primPlusNat0(Succ(wy1920), wy202), ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_map11(wy201, wy1920, wy202, Zero, ba) → new_map11(new_primPlusNat0(Succ(wy1920), wy202), wy1920, new_primPlusNat0(Succ(wy1920), wy202), new_primPlusNat0(Succ(wy1920), wy202), ba)

The remaining pairs can at least be oriented weakly.

new_map11(wy201, wy1920, wy202, Succ(wy2030), ba) → new_map12(wy201, wy1920, wy202, ba)
new_map12(wy201, wy1920, wy202, ba) → new_map11(new_primPlusNat0(Succ(wy1920), wy202), wy1920, new_primPlusNat0(Succ(wy1920), wy202), new_primPlusNat0(Succ(wy1920), wy202), ba)

Used ordering: Polynomial interpretation [25]:

POL(Succ(x₁)) = 0
POL(Zero) = 1
POL(new_map11(x₁, x₂, x₃, x₄, x₅)) = x₄
POL(new_map12(x₁, x₂, x₃, x₄)) = 0
POL(new_primPlusNat0(x₁, x₂)) = 0

The following usable rules [17] were oriented:

new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map11(wy201, wy1920, wy202, Succ(wy2030), ba) → new_map12(wy201, wy1920, wy202, ba)
new_map12(wy201, wy1920, wy202, ba) → new_map11(new_primPlusNat0(Succ(wy1920), wy202), wy1920, new_primPlusNat0(Succ(wy1920), wy202), new_primPlusNat0(Succ(wy1920), wy202), ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule new_map12(wy201, wy1920, wy202, ba) → new_map11(new_primPlusNat0(Succ(wy1920), wy202), wy1920, new_primPlusNat0(Succ(wy1920), wy202), new_primPlusNat0(Succ(wy1920), wy202), ba) at position [3] we obtained the following new rules:

new_map12(y0, x0, Succ(x1), y3) → new_map11(new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y3)
new_map12(y0, x0, Zero, y3) → new_map11(new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y3)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map12(y0, x0, Succ(x1), y3) → new_map11(new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y3)
new_map11(wy201, wy1920, wy202, Succ(wy2030), ba) → new_map12(wy201, wy1920, wy202, ba)
new_map12(y0, x0, Zero, y3) → new_map11(new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y3)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map12(y0, x0, Succ(x1), y3) → new_map11(new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y3) at position [0] we obtained the following new rules:

new_map12(y0, x0, Succ(x1), y3) → new_map11(Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y3)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map12(y0, x0, Succ(x1), y3) → new_map11(Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y3)
new_map11(wy201, wy1920, wy202, Succ(wy2030), ba) → new_map12(wy201, wy1920, wy202, ba)
new_map12(y0, x0, Zero, y3) → new_map11(new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y3)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map12(y0, x0, Zero, y3) → new_map11(new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y3) at position [0] we obtained the following new rules:

new_map12(y0, x0, Zero, y3) → new_map11(Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y3)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map12(y0, x0, Succ(x1), y3) → new_map11(Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y3)
new_map12(y0, x0, Zero, y3) → new_map11(Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y3)
new_map11(wy201, wy1920, wy202, Succ(wy2030), ba) → new_map12(wy201, wy1920, wy202, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map12(y0, x0, Succ(x1), y3) → new_map11(Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y3) at position [2] we obtained the following new rules:

new_map12(y0, x0, Succ(x1), y3) → new_map11(Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y3)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map12(y0, x0, Zero, y3) → new_map11(Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y3)
new_map12(y0, x0, Succ(x1), y3) → new_map11(Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y3)
new_map11(wy201, wy1920, wy202, Succ(wy2030), ba) → new_map12(wy201, wy1920, wy202, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map12(y0, x0, Zero, y3) → new_map11(Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y3) at position [2] we obtained the following new rules:

new_map12(y0, x0, Zero, y3) → new_map11(Succ(x0), x0, Succ(x0), Succ(x0), y3)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Instantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map12(y0, x0, Zero, y3) → new_map11(Succ(x0), x0, Succ(x0), Succ(x0), y3)
new_map12(y0, x0, Succ(x1), y3) → new_map11(Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y3)
new_map11(wy201, wy1920, wy202, Succ(wy2030), ba) → new_map12(wy201, wy1920, wy202, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_map11(wy201, wy1920, wy202, Succ(wy2030), ba) → new_map12(wy201, wy1920, wy202, ba) we obtained the following new rules:

new_map11(Succ(Succ(y_0)), z1, Succ(Succ(y_1)), Succ(Succ(y_2)), z3) → new_map12(Succ(Succ(y_0)), z1, Succ(Succ(y_1)), z3)
new_map11(Succ(z1), z1, Succ(z1), Succ(z1), z2) → new_map12(Succ(z1), z1, Succ(z1), z2)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Instantiation

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map11(Succ(Succ(y_0)), z1, Succ(Succ(y_1)), Succ(Succ(y_2)), z3) → new_map12(Succ(Succ(y_0)), z1, Succ(Succ(y_1)), z3)
new_map12(y0, x0, Zero, y3) → new_map11(Succ(x0), x0, Succ(x0), Succ(x0), y3)
new_map12(y0, x0, Succ(x1), y3) → new_map11(Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y3)
new_map11(Succ(z1), z1, Succ(z1), Succ(z1), z2) → new_map12(Succ(z1), z1, Succ(z1), z2)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Instantiation

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ QDP

                                                    ↳ Instantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map11(Succ(Succ(y_0)), z1, Succ(Succ(y_1)), Succ(Succ(y_2)), z3) → new_map12(Succ(Succ(y_0)), z1, Succ(Succ(y_1)), z3)
new_map12(y0, x0, Succ(x1), y3) → new_map11(Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y3)
new_map11(Succ(z1), z1, Succ(z1), Succ(z1), z2) → new_map12(Succ(z1), z1, Succ(z1), z2)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_map12(y0, x0, Succ(x1), y3) → new_map11(Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y3) we obtained the following new rules:

new_map12(Succ(Succ(z0)), z1, Succ(Succ(z2)), z4) → new_map11(Succ(Succ(new_primPlusNat0(z1, Succ(z2)))), z1, Succ(Succ(new_primPlusNat0(z1, Succ(z2)))), Succ(Succ(new_primPlusNat0(z1, Succ(z2)))), z4)
new_map12(Succ(z0), z0, Succ(z0), z1) → new_map11(Succ(Succ(new_primPlusNat0(z0, z0))), z0, Succ(Succ(new_primPlusNat0(z0, z0))), Succ(Succ(new_primPlusNat0(z0, z0))), z1)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Instantiation

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ QDP

                                                    ↳ Instantiation

                                                      ↳ QDP

                                                        ↳ Instantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map12(Succ(Succ(z0)), z1, Succ(Succ(z2)), z4) → new_map11(Succ(Succ(new_primPlusNat0(z1, Succ(z2)))), z1, Succ(Succ(new_primPlusNat0(z1, Succ(z2)))), Succ(Succ(new_primPlusNat0(z1, Succ(z2)))), z4)
new_map11(Succ(Succ(y_0)), z1, Succ(Succ(y_1)), Succ(Succ(y_2)), z3) → new_map12(Succ(Succ(y_0)), z1, Succ(Succ(y_1)), z3)
new_map12(Succ(z0), z0, Succ(z0), z1) → new_map11(Succ(Succ(new_primPlusNat0(z0, z0))), z0, Succ(Succ(new_primPlusNat0(z0, z0))), Succ(Succ(new_primPlusNat0(z0, z0))), z1)
new_map11(Succ(z1), z1, Succ(z1), Succ(z1), z2) → new_map12(Succ(z1), z1, Succ(z1), z2)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_map11(Succ(z1), z1, Succ(z1), Succ(z1), z2) → new_map12(Succ(z1), z1, Succ(z1), z2) we obtained the following new rules:

new_map11(Succ(Succ(y_0)), Succ(y_0), Succ(Succ(y_0)), Succ(Succ(y_0)), z3) → new_map12(Succ(Succ(y_0)), Succ(y_0), Succ(Succ(y_0)), z3)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Instantiation

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ QDP

                                                    ↳ Instantiation

                                                      ↳ QDP

                                                        ↳ Instantiation

                                                          ↳ QDP

                                                            ↳ Instantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map11(Succ(Succ(y_0)), z1, Succ(Succ(y_1)), Succ(Succ(y_2)), z3) → new_map12(Succ(Succ(y_0)), z1, Succ(Succ(y_1)), z3)
new_map12(Succ(Succ(z0)), z1, Succ(Succ(z2)), z4) → new_map11(Succ(Succ(new_primPlusNat0(z1, Succ(z2)))), z1, Succ(Succ(new_primPlusNat0(z1, Succ(z2)))), Succ(Succ(new_primPlusNat0(z1, Succ(z2)))), z4)
new_map12(Succ(z0), z0, Succ(z0), z1) → new_map11(Succ(Succ(new_primPlusNat0(z0, z0))), z0, Succ(Succ(new_primPlusNat0(z0, z0))), Succ(Succ(new_primPlusNat0(z0, z0))), z1)
new_map11(Succ(Succ(y_0)), Succ(y_0), Succ(Succ(y_0)), Succ(Succ(y_0)), z3) → new_map12(Succ(Succ(y_0)), Succ(y_0), Succ(Succ(y_0)), z3)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_map12(Succ(z0), z0, Succ(z0), z1) → new_map11(Succ(Succ(new_primPlusNat0(z0, z0))), z0, Succ(Succ(new_primPlusNat0(z0, z0))), Succ(Succ(new_primPlusNat0(z0, z0))), z1) we obtained the following new rules:

new_map12(Succ(Succ(z0)), Succ(z0), Succ(Succ(z0)), z4) → new_map11(Succ(Succ(new_primPlusNat0(Succ(z0), Succ(z0)))), Succ(z0), Succ(Succ(new_primPlusNat0(Succ(z0), Succ(z0)))), Succ(Succ(new_primPlusNat0(Succ(z0), Succ(z0)))), z4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Instantiation

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ QDP

                                                    ↳ Instantiation

                                                      ↳ QDP

                                                        ↳ Instantiation

                                                          ↳ QDP

                                                            ↳ Instantiation

                                                              ↳ QDP

                                                                ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map12(Succ(Succ(z0)), z1, Succ(Succ(z2)), z4) → new_map11(Succ(Succ(new_primPlusNat0(z1, Succ(z2)))), z1, Succ(Succ(new_primPlusNat0(z1, Succ(z2)))), Succ(Succ(new_primPlusNat0(z1, Succ(z2)))), z4)
new_map11(Succ(Succ(y_0)), z1, Succ(Succ(y_1)), Succ(Succ(y_2)), z3) → new_map12(Succ(Succ(y_0)), z1, Succ(Succ(y_1)), z3)
new_map11(Succ(Succ(y_0)), Succ(y_0), Succ(Succ(y_0)), Succ(Succ(y_0)), z3) → new_map12(Succ(Succ(y_0)), Succ(y_0), Succ(Succ(y_0)), z3)
new_map12(Succ(Succ(z0)), Succ(z0), Succ(Succ(z0)), z4) → new_map11(Succ(Succ(new_primPlusNat0(Succ(z0), Succ(z0)))), Succ(z0), Succ(Succ(new_primPlusNat0(Succ(z0), Succ(z0)))), Succ(Succ(new_primPlusNat0(Succ(z0), Succ(z0)))), z4)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map12(Succ(Succ(z0)), Succ(z0), Succ(Succ(z0)), z4) → new_map11(Succ(Succ(new_primPlusNat0(Succ(z0), Succ(z0)))), Succ(z0), Succ(Succ(new_primPlusNat0(Succ(z0), Succ(z0)))), Succ(Succ(new_primPlusNat0(Succ(z0), Succ(z0)))), z4) at position [0,0,0] we obtained the following new rules:

new_map12(Succ(Succ(z0)), Succ(z0), Succ(Succ(z0)), z4) → new_map11(Succ(Succ(Succ(Succ(new_primPlusNat0(z0, z0))))), Succ(z0), Succ(Succ(new_primPlusNat0(Succ(z0), Succ(z0)))), Succ(Succ(new_primPlusNat0(Succ(z0), Succ(z0)))), z4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Instantiation

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ QDP

                                                    ↳ Instantiation

                                                      ↳ QDP

                                                        ↳ Instantiation

                                                          ↳ QDP

                                                            ↳ Instantiation

                                                              ↳ QDP

                                                                ↳ Rewriting

                                                                  ↳ QDP

                                                                    ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map11(Succ(Succ(y_0)), z1, Succ(Succ(y_1)), Succ(Succ(y_2)), z3) → new_map12(Succ(Succ(y_0)), z1, Succ(Succ(y_1)), z3)
new_map12(Succ(Succ(z0)), z1, Succ(Succ(z2)), z4) → new_map11(Succ(Succ(new_primPlusNat0(z1, Succ(z2)))), z1, Succ(Succ(new_primPlusNat0(z1, Succ(z2)))), Succ(Succ(new_primPlusNat0(z1, Succ(z2)))), z4)
new_map11(Succ(Succ(y_0)), Succ(y_0), Succ(Succ(y_0)), Succ(Succ(y_0)), z3) → new_map12(Succ(Succ(y_0)), Succ(y_0), Succ(Succ(y_0)), z3)
new_map12(Succ(Succ(z0)), Succ(z0), Succ(Succ(z0)), z4) → new_map11(Succ(Succ(Succ(Succ(new_primPlusNat0(z0, z0))))), Succ(z0), Succ(Succ(new_primPlusNat0(Succ(z0), Succ(z0)))), Succ(Succ(new_primPlusNat0(Succ(z0), Succ(z0)))), z4)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map12(Succ(Succ(z0)), Succ(z0), Succ(Succ(z0)), z4) → new_map11(Succ(Succ(Succ(Succ(new_primPlusNat0(z0, z0))))), Succ(z0), Succ(Succ(new_primPlusNat0(Succ(z0), Succ(z0)))), Succ(Succ(new_primPlusNat0(Succ(z0), Succ(z0)))), z4) at position [2,0,0] we obtained the following new rules:

new_map12(Succ(Succ(z0)), Succ(z0), Succ(Succ(z0)), z4) → new_map11(Succ(Succ(Succ(Succ(new_primPlusNat0(z0, z0))))), Succ(z0), Succ(Succ(Succ(Succ(new_primPlusNat0(z0, z0))))), Succ(Succ(new_primPlusNat0(Succ(z0), Succ(z0)))), z4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Instantiation

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ QDP

                                                    ↳ Instantiation

                                                      ↳ QDP

                                                        ↳ Instantiation

                                                          ↳ QDP

                                                            ↳ Instantiation

                                                              ↳ QDP

                                                                ↳ Rewriting

                                                                  ↳ QDP

                                                                    ↳ Rewriting

                                                                      ↳ QDP

                                                                        ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map12(Succ(Succ(z0)), z1, Succ(Succ(z2)), z4) → new_map11(Succ(Succ(new_primPlusNat0(z1, Succ(z2)))), z1, Succ(Succ(new_primPlusNat0(z1, Succ(z2)))), Succ(Succ(new_primPlusNat0(z1, Succ(z2)))), z4)
new_map11(Succ(Succ(y_0)), z1, Succ(Succ(y_1)), Succ(Succ(y_2)), z3) → new_map12(Succ(Succ(y_0)), z1, Succ(Succ(y_1)), z3)
new_map11(Succ(Succ(y_0)), Succ(y_0), Succ(Succ(y_0)), Succ(Succ(y_0)), z3) → new_map12(Succ(Succ(y_0)), Succ(y_0), Succ(Succ(y_0)), z3)
new_map12(Succ(Succ(z0)), Succ(z0), Succ(Succ(z0)), z4) → new_map11(Succ(Succ(Succ(Succ(new_primPlusNat0(z0, z0))))), Succ(z0), Succ(Succ(Succ(Succ(new_primPlusNat0(z0, z0))))), Succ(Succ(new_primPlusNat0(Succ(z0), Succ(z0)))), z4)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map12(Succ(Succ(z0)), Succ(z0), Succ(Succ(z0)), z4) → new_map11(Succ(Succ(Succ(Succ(new_primPlusNat0(z0, z0))))), Succ(z0), Succ(Succ(Succ(Succ(new_primPlusNat0(z0, z0))))), Succ(Succ(new_primPlusNat0(Succ(z0), Succ(z0)))), z4) at position [3,0,0] we obtained the following new rules:

new_map12(Succ(Succ(z0)), Succ(z0), Succ(Succ(z0)), z4) → new_map11(Succ(Succ(Succ(Succ(new_primPlusNat0(z0, z0))))), Succ(z0), Succ(Succ(Succ(Succ(new_primPlusNat0(z0, z0))))), Succ(Succ(Succ(Succ(new_primPlusNat0(z0, z0))))), z4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Instantiation

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ QDP

                                                    ↳ Instantiation

                                                      ↳ QDP

                                                        ↳ Instantiation

                                                          ↳ QDP

                                                            ↳ Instantiation

                                                              ↳ QDP

                                                                ↳ Rewriting

                                                                  ↳ QDP

                                                                    ↳ Rewriting

                                                                      ↳ QDP

                                                                        ↳ Rewriting

                                                                          ↳ QDP

                                                                            ↳ MNOCProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map11(Succ(Succ(y_0)), z1, Succ(Succ(y_1)), Succ(Succ(y_2)), z3) → new_map12(Succ(Succ(y_0)), z1, Succ(Succ(y_1)), z3)
new_map12(Succ(Succ(z0)), z1, Succ(Succ(z2)), z4) → new_map11(Succ(Succ(new_primPlusNat0(z1, Succ(z2)))), z1, Succ(Succ(new_primPlusNat0(z1, Succ(z2)))), Succ(Succ(new_primPlusNat0(z1, Succ(z2)))), z4)
new_map11(Succ(Succ(y_0)), Succ(y_0), Succ(Succ(y_0)), Succ(Succ(y_0)), z3) → new_map12(Succ(Succ(y_0)), Succ(y_0), Succ(Succ(y_0)), z3)
new_map12(Succ(Succ(z0)), Succ(z0), Succ(Succ(z0)), z4) → new_map11(Succ(Succ(Succ(Succ(new_primPlusNat0(z0, z0))))), Succ(z0), Succ(Succ(Succ(Succ(new_primPlusNat0(z0, z0))))), Succ(Succ(Succ(Succ(new_primPlusNat0(z0, z0))))), z4)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We use the modular non-overlap check [17] to decrease Q to the empty set.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Instantiation

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ QDP

                                                    ↳ Instantiation

                                                      ↳ QDP

                                                        ↳ Instantiation

                                                          ↳ QDP

                                                            ↳ Instantiation

                                                              ↳ QDP

                                                                ↳ Rewriting

                                                                  ↳ QDP

                                                                    ↳ Rewriting

                                                                      ↳ QDP

                                                                        ↳ Rewriting

                                                                          ↳ QDP

                                                                            ↳ MNOCProof

                                                                              ↳ QDP

                                                                                ↳ NonTerminationProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map12(Succ(Succ(z0)), z1, Succ(Succ(z2)), z4) → new_map11(Succ(Succ(new_primPlusNat0(z1, Succ(z2)))), z1, Succ(Succ(new_primPlusNat0(z1, Succ(z2)))), Succ(Succ(new_primPlusNat0(z1, Succ(z2)))), z4)
new_map11(Succ(Succ(y_0)), z1, Succ(Succ(y_1)), Succ(Succ(y_2)), z3) → new_map12(Succ(Succ(y_0)), z1, Succ(Succ(y_1)), z3)
new_map11(Succ(Succ(y_0)), Succ(y_0), Succ(Succ(y_0)), Succ(Succ(y_0)), z3) → new_map12(Succ(Succ(y_0)), Succ(y_0), Succ(Succ(y_0)), z3)
new_map12(Succ(Succ(z0)), Succ(z0), Succ(Succ(z0)), z4) → new_map11(Succ(Succ(Succ(Succ(new_primPlusNat0(z0, z0))))), Succ(z0), Succ(Succ(Succ(Succ(new_primPlusNat0(z0, z0))))), Succ(Succ(Succ(Succ(new_primPlusNat0(z0, z0))))), z4)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

Q is empty.
We have to consider all (P,Q,R)-chains.
We used the non-termination processor [17] to show that the DP problem is infinite.
Found a loop by narrowing to the left:

The TRS P consists of the following rules:

new_map12(Succ(Succ(z0)), z1, Succ(Succ(z2)), z4) → new_map11(Succ(Succ(new_primPlusNat0(z1, Succ(z2)))), z1, Succ(Succ(new_primPlusNat0(z1, Succ(z2)))), Succ(Succ(new_primPlusNat0(z1, Succ(z2)))), z4)
new_map11(Succ(Succ(y_0)), z1, Succ(Succ(y_1)), Succ(Succ(y_2)), z3) → new_map12(Succ(Succ(y_0)), z1, Succ(Succ(y_1)), z3)
new_map11(Succ(Succ(y_0)), Succ(y_0), Succ(Succ(y_0)), Succ(Succ(y_0)), z3) → new_map12(Succ(Succ(y_0)), Succ(y_0), Succ(Succ(y_0)), z3)
new_map12(Succ(Succ(z0)), Succ(z0), Succ(Succ(z0)), z4) → new_map11(Succ(Succ(Succ(Succ(new_primPlusNat0(z0, z0))))), Succ(z0), Succ(Succ(Succ(Succ(new_primPlusNat0(z0, z0))))), Succ(Succ(Succ(Succ(new_primPlusNat0(z0, z0))))), z4)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

s = new_map11(Succ(Succ(y_0)), z1', Succ(Succ(y_1)), Succ(Succ(y_2)), z3) evaluates to t =new_map11(Succ(Succ(new_primPlusNat0(z1', Succ(y_1)))), z1', Succ(Succ(new_primPlusNat0(z1', Succ(y_1)))), Succ(Succ(new_primPlusNat0(z1', Succ(y_1)))), z3)

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:

Matcher: [y_2 / new_primPlusNat0(z1', Succ(y_1)), y_1 / new_primPlusNat0(z1', Succ(y_1)), y_0 / new_primPlusNat0(z1', Succ(y_1))]
Semiunifier: [ ]

Rewriting sequence

new_map11(Succ(Succ(y_0)), z1', Succ(Succ(y_1)), Succ(Succ(y_2)), z3) → new_map12(Succ(Succ(y_0)), z1', Succ(Succ(y_1)), z3)
with rule new_map11(Succ(Succ(y_0')), z1'', Succ(Succ(y_1')), Succ(Succ(y_2')), z3') → new_map12(Succ(Succ(y_0')), z1'', Succ(Succ(y_1')), z3') at position [] and matcher [y_2' / y_2, z3' / z3, y_0' / y_0, y_1' / y_1, z1'' / z1']

new_map12(Succ(Succ(y_0)), z1', Succ(Succ(y_1)), z3) → new_map11(Succ(Succ(new_primPlusNat0(z1', Succ(y_1)))), z1', Succ(Succ(new_primPlusNat0(z1', Succ(y_1)))), Succ(Succ(new_primPlusNat0(z1', Succ(y_1)))), z3)
with rule new_map12(Succ(Succ(z0)), z1, Succ(Succ(z2)), z4) → new_map11(Succ(Succ(new_primPlusNat0(z1, Succ(z2)))), z1, Succ(Succ(new_primPlusNat0(z1, Succ(z2)))), Succ(Succ(new_primPlusNat0(z1, Succ(z2)))), z4)

Now applying the matcher to the start term leads to a term which is equal to the last term in the rewriting sequence

All these steps are and every following step will be a correct step w.r.t to Q.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map14(wy347, wy348, wy349, Zero, Zero, bb) → new_map15(wy347, wy348, wy349, bb)
new_map15(wy347, wy348, wy349, bb) → new_map13(wy347, new_primPlusNat0(Zero, wy349), new_primPlusNat0(Zero, wy349), new_primPlusNat0(Zero, wy349), bb)
new_map13(wy276, wy283, wy284, Zero, ba) → new_map14(wy276, wy283, wy284, Zero, Succ(wy276), ba)
new_map13(wy276, wy283, wy284, Succ(wy2850), ba) → new_map14(wy276, wy283, wy284, Succ(wy2850), Succ(wy276), ba)
new_map14(wy347, wy348, wy349, Succ(wy3500), Succ(wy3510), bb) → new_map14(wy347, wy348, wy349, wy3500, wy3510, bb)
new_map14(wy347, wy348, wy349, Succ(wy3500), Zero, bb) → new_map13(wy347, new_primPlusNat0(Zero, wy349), new_primPlusNat0(Zero, wy349), new_primPlusNat0(Zero, wy349), bb)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ UsableRulesProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map14(wy347, wy348, wy349, Zero, Zero, bb) → new_map15(wy347, wy348, wy349, bb)
new_map15(wy347, wy348, wy349, bb) → new_map13(wy347, new_primPlusNat0(Zero, wy349), new_primPlusNat0(Zero, wy349), new_primPlusNat0(Zero, wy349), bb)
new_map13(wy276, wy283, wy284, Succ(wy2850), ba) → new_map14(wy276, wy283, wy284, Succ(wy2850), Succ(wy276), ba)
new_map14(wy347, wy348, wy349, Succ(wy3500), Succ(wy3510), bb) → new_map14(wy347, wy348, wy349, wy3500, wy3510, bb)
new_map14(wy347, wy348, wy349, Succ(wy3500), Zero, bb) → new_map13(wy347, new_primPlusNat0(Zero, wy349), new_primPlusNat0(Zero, wy349), new_primPlusNat0(Zero, wy349), bb)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ UsableRulesProof

                          ↳ QDP

                            ↳ Narrowing

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map14(wy347, wy348, wy349, Zero, Zero, bb) → new_map15(wy347, wy348, wy349, bb)
new_map15(wy347, wy348, wy349, bb) → new_map13(wy347, new_primPlusNat0(Zero, wy349), new_primPlusNat0(Zero, wy349), new_primPlusNat0(Zero, wy349), bb)
new_map13(wy276, wy283, wy284, Succ(wy2850), ba) → new_map14(wy276, wy283, wy284, Succ(wy2850), Succ(wy276), ba)
new_map14(wy347, wy348, wy349, Succ(wy3500), Succ(wy3510), bb) → new_map14(wy347, wy348, wy349, wy3500, wy3510, bb)
new_map14(wy347, wy348, wy349, Succ(wy3500), Zero, bb) → new_map13(wy347, new_primPlusNat0(Zero, wy349), new_primPlusNat0(Zero, wy349), new_primPlusNat0(Zero, wy349), bb)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule new_map15(wy347, wy348, wy349, bb) → new_map13(wy347, new_primPlusNat0(Zero, wy349), new_primPlusNat0(Zero, wy349), new_primPlusNat0(Zero, wy349), bb) at position [3] we obtained the following new rules:

new_map15(y0, y1, Succ(x0), y3) → new_map13(y0, new_primPlusNat0(Zero, Succ(x0)), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y3)
new_map15(y0, y1, Zero, y3) → new_map13(y0, new_primPlusNat0(Zero, Zero), new_primPlusNat0(Zero, Zero), Zero, y3)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ UsableRulesProof

                          ↳ QDP

                            ↳ Narrowing

                              ↳ QDP

                                ↳ DependencyGraphProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map14(wy347, wy348, wy349, Zero, Zero, bb) → new_map15(wy347, wy348, wy349, bb)
new_map15(y0, y1, Zero, y3) → new_map13(y0, new_primPlusNat0(Zero, Zero), new_primPlusNat0(Zero, Zero), Zero, y3)
new_map13(wy276, wy283, wy284, Succ(wy2850), ba) → new_map14(wy276, wy283, wy284, Succ(wy2850), Succ(wy276), ba)
new_map14(wy347, wy348, wy349, Succ(wy3500), Succ(wy3510), bb) → new_map14(wy347, wy348, wy349, wy3500, wy3510, bb)
new_map15(y0, y1, Succ(x0), y3) → new_map13(y0, new_primPlusNat0(Zero, Succ(x0)), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y3)
new_map14(wy347, wy348, wy349, Succ(wy3500), Zero, bb) → new_map13(wy347, new_primPlusNat0(Zero, wy349), new_primPlusNat0(Zero, wy349), new_primPlusNat0(Zero, wy349), bb)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ UsableRulesProof

                          ↳ QDP

                            ↳ Narrowing

                              ↳ QDP

                                ↳ DependencyGraphProof

                                  ↳ QDP

                                    ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map14(wy347, wy348, wy349, Zero, Zero, bb) → new_map15(wy347, wy348, wy349, bb)
new_map13(wy276, wy283, wy284, Succ(wy2850), ba) → new_map14(wy276, wy283, wy284, Succ(wy2850), Succ(wy276), ba)
new_map14(wy347, wy348, wy349, Succ(wy3500), Succ(wy3510), bb) → new_map14(wy347, wy348, wy349, wy3500, wy3510, bb)
new_map15(y0, y1, Succ(x0), y3) → new_map13(y0, new_primPlusNat0(Zero, Succ(x0)), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y3)
new_map14(wy347, wy348, wy349, Succ(wy3500), Zero, bb) → new_map13(wy347, new_primPlusNat0(Zero, wy349), new_primPlusNat0(Zero, wy349), new_primPlusNat0(Zero, wy349), bb)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map15(y0, y1, Succ(x0), y3) → new_map13(y0, new_primPlusNat0(Zero, Succ(x0)), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y3) at position [1] we obtained the following new rules:

new_map15(y0, y1, Succ(x0), y3) → new_map13(y0, Succ(x0), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y3)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ UsableRulesProof

                          ↳ QDP

                            ↳ Narrowing

                              ↳ QDP

                                ↳ DependencyGraphProof

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map14(wy347, wy348, wy349, Zero, Zero, bb) → new_map15(wy347, wy348, wy349, bb)
new_map13(wy276, wy283, wy284, Succ(wy2850), ba) → new_map14(wy276, wy283, wy284, Succ(wy2850), Succ(wy276), ba)
new_map14(wy347, wy348, wy349, Succ(wy3500), Succ(wy3510), bb) → new_map14(wy347, wy348, wy349, wy3500, wy3510, bb)
new_map15(y0, y1, Succ(x0), y3) → new_map13(y0, Succ(x0), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y3)
new_map14(wy347, wy348, wy349, Succ(wy3500), Zero, bb) → new_map13(wy347, new_primPlusNat0(Zero, wy349), new_primPlusNat0(Zero, wy349), new_primPlusNat0(Zero, wy349), bb)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map15(y0, y1, Succ(x0), y3) → new_map13(y0, Succ(x0), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y3) at position [2] we obtained the following new rules:

new_map15(y0, y1, Succ(x0), y3) → new_map13(y0, Succ(x0), Succ(x0), Succ(x0), y3)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ UsableRulesProof

                          ↳ QDP

                            ↳ Narrowing

                              ↳ QDP

                                ↳ DependencyGraphProof

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map14(wy347, wy348, wy349, Zero, Zero, bb) → new_map15(wy347, wy348, wy349, bb)
new_map13(wy276, wy283, wy284, Succ(wy2850), ba) → new_map14(wy276, wy283, wy284, Succ(wy2850), Succ(wy276), ba)
new_map14(wy347, wy348, wy349, Succ(wy3500), Succ(wy3510), bb) → new_map14(wy347, wy348, wy349, wy3500, wy3510, bb)
new_map15(y0, y1, Succ(x0), y3) → new_map13(y0, Succ(x0), Succ(x0), Succ(x0), y3)
new_map14(wy347, wy348, wy349, Succ(wy3500), Zero, bb) → new_map13(wy347, new_primPlusNat0(Zero, wy349), new_primPlusNat0(Zero, wy349), new_primPlusNat0(Zero, wy349), bb)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule new_map14(wy347, wy348, wy349, Succ(wy3500), Zero, bb) → new_map13(wy347, new_primPlusNat0(Zero, wy349), new_primPlusNat0(Zero, wy349), new_primPlusNat0(Zero, wy349), bb) at position [3] we obtained the following new rules:

new_map14(y0, y1, Zero, Succ(y3), Zero, y4) → new_map13(y0, new_primPlusNat0(Zero, Zero), new_primPlusNat0(Zero, Zero), Zero, y4)
new_map14(y0, y1, Succ(x0), Succ(y3), Zero, y4) → new_map13(y0, new_primPlusNat0(Zero, Succ(x0)), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ UsableRulesProof

                          ↳ QDP

                            ↳ Narrowing

                              ↳ QDP

                                ↳ DependencyGraphProof

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map14(wy347, wy348, wy349, Zero, Zero, bb) → new_map15(wy347, wy348, wy349, bb)
new_map14(y0, y1, Succ(x0), Succ(y3), Zero, y4) → new_map13(y0, new_primPlusNat0(Zero, Succ(x0)), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y4)
new_map13(wy276, wy283, wy284, Succ(wy2850), ba) → new_map14(wy276, wy283, wy284, Succ(wy2850), Succ(wy276), ba)
new_map14(wy347, wy348, wy349, Succ(wy3500), Succ(wy3510), bb) → new_map14(wy347, wy348, wy349, wy3500, wy3510, bb)
new_map14(y0, y1, Zero, Succ(y3), Zero, y4) → new_map13(y0, new_primPlusNat0(Zero, Zero), new_primPlusNat0(Zero, Zero), Zero, y4)
new_map15(y0, y1, Succ(x0), y3) → new_map13(y0, Succ(x0), Succ(x0), Succ(x0), y3)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ UsableRulesProof

                          ↳ QDP

                            ↳ Narrowing

                              ↳ QDP

                                ↳ DependencyGraphProof

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ QDP

                                                    ↳ UsableRulesProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map14(wy347, wy348, wy349, Zero, Zero, bb) → new_map15(wy347, wy348, wy349, bb)
new_map14(y0, y1, Succ(x0), Succ(y3), Zero, y4) → new_map13(y0, new_primPlusNat0(Zero, Succ(x0)), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y4)
new_map13(wy276, wy283, wy284, Succ(wy2850), ba) → new_map14(wy276, wy283, wy284, Succ(wy2850), Succ(wy276), ba)
new_map14(wy347, wy348, wy349, Succ(wy3500), Succ(wy3510), bb) → new_map14(wy347, wy348, wy349, wy3500, wy3510, bb)
new_map15(y0, y1, Succ(x0), y3) → new_map13(y0, Succ(x0), Succ(x0), Succ(x0), y3)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ UsableRulesProof

                          ↳ QDP

                            ↳ Narrowing

                              ↳ QDP

                                ↳ DependencyGraphProof

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ QDP

                                                    ↳ UsableRulesProof

                                                      ↳ QDP

                                                        ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map14(wy347, wy348, wy349, Zero, Zero, bb) → new_map15(wy347, wy348, wy349, bb)
new_map14(y0, y1, Succ(x0), Succ(y3), Zero, y4) → new_map13(y0, new_primPlusNat0(Zero, Succ(x0)), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y4)
new_map13(wy276, wy283, wy284, Succ(wy2850), ba) → new_map14(wy276, wy283, wy284, Succ(wy2850), Succ(wy276), ba)
new_map14(wy347, wy348, wy349, Succ(wy3500), Succ(wy3510), bb) → new_map14(wy347, wy348, wy349, wy3500, wy3510, bb)
new_map15(y0, y1, Succ(x0), y3) → new_map13(y0, Succ(x0), Succ(x0), Succ(x0), y3)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map14(y0, y1, Succ(x0), Succ(y3), Zero, y4) → new_map13(y0, new_primPlusNat0(Zero, Succ(x0)), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y4) at position [1] we obtained the following new rules:

new_map14(y0, y1, Succ(x0), Succ(y3), Zero, y4) → new_map13(y0, Succ(x0), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ UsableRulesProof

                          ↳ QDP

                            ↳ Narrowing

                              ↳ QDP

                                ↳ DependencyGraphProof

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ QDP

                                                    ↳ UsableRulesProof

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map14(wy347, wy348, wy349, Zero, Zero, bb) → new_map15(wy347, wy348, wy349, bb)
new_map13(wy276, wy283, wy284, Succ(wy2850), ba) → new_map14(wy276, wy283, wy284, Succ(wy2850), Succ(wy276), ba)
new_map14(y0, y1, Succ(x0), Succ(y3), Zero, y4) → new_map13(y0, Succ(x0), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y4)
new_map14(wy347, wy348, wy349, Succ(wy3500), Succ(wy3510), bb) → new_map14(wy347, wy348, wy349, wy3500, wy3510, bb)
new_map15(y0, y1, Succ(x0), y3) → new_map13(y0, Succ(x0), Succ(x0), Succ(x0), y3)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map14(y0, y1, Succ(x0), Succ(y3), Zero, y4) → new_map13(y0, Succ(x0), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y4) at position [2] we obtained the following new rules:

new_map14(y0, y1, Succ(x0), Succ(y3), Zero, y4) → new_map13(y0, Succ(x0), Succ(x0), Succ(x0), y4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ UsableRulesProof

                          ↳ QDP

                            ↳ Narrowing

                              ↳ QDP

                                ↳ DependencyGraphProof

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ QDP

                                                    ↳ UsableRulesProof

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ UsableRulesProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map14(wy347, wy348, wy349, Zero, Zero, bb) → new_map15(wy347, wy348, wy349, bb)
new_map13(wy276, wy283, wy284, Succ(wy2850), ba) → new_map14(wy276, wy283, wy284, Succ(wy2850), Succ(wy276), ba)
new_map14(wy347, wy348, wy349, Succ(wy3500), Succ(wy3510), bb) → new_map14(wy347, wy348, wy349, wy3500, wy3510, bb)
new_map15(y0, y1, Succ(x0), y3) → new_map13(y0, Succ(x0), Succ(x0), Succ(x0), y3)
new_map14(y0, y1, Succ(x0), Succ(y3), Zero, y4) → new_map13(y0, Succ(x0), Succ(x0), Succ(x0), y4)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ UsableRulesProof

                          ↳ QDP

                            ↳ Narrowing

                              ↳ QDP

                                ↳ DependencyGraphProof

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ QDP

                                                    ↳ UsableRulesProof

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ UsableRulesProof

                                                                  ↳ QDP

                                                                    ↳ QReductionProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map14(wy347, wy348, wy349, Zero, Zero, bb) → new_map15(wy347, wy348, wy349, bb)
new_map13(wy276, wy283, wy284, Succ(wy2850), ba) → new_map14(wy276, wy283, wy284, Succ(wy2850), Succ(wy276), ba)
new_map14(wy347, wy348, wy349, Succ(wy3500), Succ(wy3510), bb) → new_map14(wy347, wy348, wy349, wy3500, wy3510, bb)
new_map15(y0, y1, Succ(x0), y3) → new_map13(y0, Succ(x0), Succ(x0), Succ(x0), y3)
new_map14(y0, y1, Succ(x0), Succ(y3), Zero, y4) → new_map13(y0, Succ(x0), Succ(x0), Succ(x0), y4)

R is empty.
The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ UsableRulesProof

                          ↳ QDP

                            ↳ Narrowing

                              ↳ QDP

                                ↳ DependencyGraphProof

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ QDP

                                                    ↳ UsableRulesProof

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ UsableRulesProof

                                                                  ↳ QDP

                                                                    ↳ QReductionProof

                                                                      ↳ QDP

                                                                        ↳ Instantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map14(wy347, wy348, wy349, Zero, Zero, bb) → new_map15(wy347, wy348, wy349, bb)
new_map13(wy276, wy283, wy284, Succ(wy2850), ba) → new_map14(wy276, wy283, wy284, Succ(wy2850), Succ(wy276), ba)
new_map14(wy347, wy348, wy349, Succ(wy3500), Succ(wy3510), bb) → new_map14(wy347, wy348, wy349, wy3500, wy3510, bb)
new_map15(y0, y1, Succ(x0), y3) → new_map13(y0, Succ(x0), Succ(x0), Succ(x0), y3)
new_map14(y0, y1, Succ(x0), Succ(y3), Zero, y4) → new_map13(y0, Succ(x0), Succ(x0), Succ(x0), y4)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_map13(wy276, wy283, wy284, Succ(wy2850), ba) → new_map14(wy276, wy283, wy284, Succ(wy2850), Succ(wy276), ba) we obtained the following new rules:

new_map13(z0, Succ(z2), Succ(z2), Succ(z2), z3) → new_map14(z0, Succ(z2), Succ(z2), Succ(z2), Succ(z0), z3)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ UsableRulesProof

                          ↳ QDP

                            ↳ Narrowing

                              ↳ QDP

                                ↳ DependencyGraphProof

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ QDP

                                                    ↳ UsableRulesProof

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ UsableRulesProof

                                                                  ↳ QDP

                                                                    ↳ QReductionProof

                                                                      ↳ QDP

                                                                        ↳ Instantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map14(wy347, wy348, wy349, Zero, Zero, bb) → new_map15(wy347, wy348, wy349, bb)
new_map13(z0, Succ(z2), Succ(z2), Succ(z2), z3) → new_map14(z0, Succ(z2), Succ(z2), Succ(z2), Succ(z0), z3)
new_map14(wy347, wy348, wy349, Succ(wy3500), Succ(wy3510), bb) → new_map14(wy347, wy348, wy349, wy3500, wy3510, bb)
new_map15(y0, y1, Succ(x0), y3) → new_map13(y0, Succ(x0), Succ(x0), Succ(x0), y3)
new_map14(y0, y1, Succ(x0), Succ(y3), Zero, y4) → new_map13(y0, Succ(x0), Succ(x0), Succ(x0), y4)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map14(wy347, wy348, wy349, Zero, Zero, bb) → new_map15(wy347, wy348, wy349, bb) we obtained the following new rules:

new_map14(x0, x1, Succ(y_2), Zero, Zero, x3) → new_map15(x0, x1, Succ(y_2), x3)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ UsableRulesProof

                          ↳ QDP

                            ↳ Narrowing

                              ↳ QDP

                                ↳ DependencyGraphProof

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ QDP

                                                    ↳ UsableRulesProof

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ UsableRulesProof

                                                                  ↳ QDP

                                                                    ↳ QReductionProof

                                                                      ↳ QDP

                                                                        ↳ Instantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map14(x0, x1, Succ(y_2), Zero, Zero, x3) → new_map15(x0, x1, Succ(y_2), x3)
new_map13(z0, Succ(z2), Succ(z2), Succ(z2), z3) → new_map14(z0, Succ(z2), Succ(z2), Succ(z2), Succ(z0), z3)
new_map14(wy347, wy348, wy349, Succ(wy3500), Succ(wy3510), bb) → new_map14(wy347, wy348, wy349, wy3500, wy3510, bb)
new_map15(y0, y1, Succ(x0), y3) → new_map13(y0, Succ(x0), Succ(x0), Succ(x0), y3)
new_map14(y0, y1, Succ(x0), Succ(y3), Zero, y4) → new_map13(y0, Succ(x0), Succ(x0), Succ(x0), y4)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map14(wy347, wy348, wy349, Succ(wy3500), Succ(wy3510), bb) → new_map14(wy347, wy348, wy349, wy3500, wy3510, bb) we obtained the following new rules:

new_map14(x0, x1, Succ(y_2), Succ(Zero), Succ(Zero), x5) → new_map14(x0, x1, Succ(y_2), Zero, Zero, x5)
new_map14(x0, x1, x2, Succ(Succ(y_3)), Succ(Succ(y_4)), x5) → new_map14(x0, x1, x2, Succ(y_3), Succ(y_4), x5)
new_map14(x0, x1, Succ(y_2), Succ(Succ(y_3)), Succ(Zero), x5) → new_map14(x0, x1, Succ(y_2), Succ(y_3), Zero, x5)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ UsableRulesProof

                          ↳ QDP

                            ↳ Narrowing

                              ↳ QDP

                                ↳ DependencyGraphProof

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ QDP

                                                    ↳ UsableRulesProof

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ UsableRulesProof

                                                                  ↳ QDP

                                                                    ↳ QReductionProof

                                                                      ↳ QDP

                                                                        ↳ Instantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map14(x0, x1, Succ(y_2), Zero, Zero, x3) → new_map15(x0, x1, Succ(y_2), x3)
new_map14(x0, x1, x2, Succ(Succ(y_3)), Succ(Succ(y_4)), x5) → new_map14(x0, x1, x2, Succ(y_3), Succ(y_4), x5)
new_map14(x0, x1, Succ(y_2), Succ(Zero), Succ(Zero), x5) → new_map14(x0, x1, Succ(y_2), Zero, Zero, x5)
new_map13(z0, Succ(z2), Succ(z2), Succ(z2), z3) → new_map14(z0, Succ(z2), Succ(z2), Succ(z2), Succ(z0), z3)
new_map14(x0, x1, Succ(y_2), Succ(Succ(y_3)), Succ(Zero), x5) → new_map14(x0, x1, Succ(y_2), Succ(y_3), Zero, x5)
new_map15(y0, y1, Succ(x0), y3) → new_map13(y0, Succ(x0), Succ(x0), Succ(x0), y3)
new_map14(y0, y1, Succ(x0), Succ(y3), Zero, y4) → new_map13(y0, Succ(x0), Succ(x0), Succ(x0), y4)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map13(z0, Succ(z2), Succ(z2), Succ(z2), z3) → new_map14(z0, Succ(z2), Succ(z2), Succ(z2), Succ(z0), z3) we obtained the following new rules:

new_map13(Zero, Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), x2) → new_map14(Zero, Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Zero), x2)
new_map13(Succ(y_4), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), x2) → new_map14(Succ(y_4), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_4)), x2)
new_map13(Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2) → new_map14(Zero, Succ(Zero), Succ(Zero), Succ(Zero), Succ(Zero), x2)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ UsableRulesProof

                          ↳ QDP

                            ↳ Narrowing

                              ↳ QDP

                                ↳ DependencyGraphProof

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ QDP

                                                    ↳ UsableRulesProof

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ UsableRulesProof

                                                                  ↳ QDP

                                                                    ↳ QReductionProof

                                                                      ↳ QDP

                                                                        ↳ Instantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                                                                                      ↳ QDP

                                                                                        ↳ ForwardInstantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map13(Zero, Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), x2) → new_map14(Zero, Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Zero), x2)
new_map14(x0, x1, Succ(y_2), Zero, Zero, x3) → new_map15(x0, x1, Succ(y_2), x3)
new_map14(x0, x1, Succ(y_2), Succ(Zero), Succ(Zero), x5) → new_map14(x0, x1, Succ(y_2), Zero, Zero, x5)
new_map14(x0, x1, x2, Succ(Succ(y_3)), Succ(Succ(y_4)), x5) → new_map14(x0, x1, x2, Succ(y_3), Succ(y_4), x5)
new_map13(Succ(y_4), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), x2) → new_map14(Succ(y_4), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_4)), x2)
new_map13(Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2) → new_map14(Zero, Succ(Zero), Succ(Zero), Succ(Zero), Succ(Zero), x2)
new_map14(x0, x1, Succ(y_2), Succ(Succ(y_3)), Succ(Zero), x5) → new_map14(x0, x1, Succ(y_2), Succ(y_3), Zero, x5)
new_map15(y0, y1, Succ(x0), y3) → new_map13(y0, Succ(x0), Succ(x0), Succ(x0), y3)
new_map14(y0, y1, Succ(x0), Succ(y3), Zero, y4) → new_map13(y0, Succ(x0), Succ(x0), Succ(x0), y4)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map15(y0, y1, Succ(x0), y3) → new_map13(y0, Succ(x0), Succ(x0), Succ(x0), y3) we obtained the following new rules:

new_map15(Succ(y_0), x1, Succ(Succ(y_1)), x3) → new_map13(Succ(y_0), Succ(Succ(y_1)), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map15(Zero, x1, Succ(Zero), x3) → new_map13(Zero, Succ(Zero), Succ(Zero), Succ(Zero), x3)
new_map15(Zero, x1, Succ(Succ(y_0)), x3) → new_map13(Zero, Succ(Succ(y_0)), Succ(Succ(y_0)), Succ(Succ(y_0)), x3)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ UsableRulesProof

                          ↳ QDP

                            ↳ Narrowing

                              ↳ QDP

                                ↳ DependencyGraphProof

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ QDP

                                                    ↳ UsableRulesProof

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ UsableRulesProof

                                                                  ↳ QDP

                                                                    ↳ QReductionProof

                                                                      ↳ QDP

                                                                        ↳ Instantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                                                                                      ↳ QDP

                                                                                        ↳ ForwardInstantiation

                                                                                          ↳ QDP

                                                                                            ↳ ForwardInstantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map14(x0, x1, Succ(y_2), Zero, Zero, x3) → new_map15(x0, x1, Succ(y_2), x3)
new_map13(Zero, Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), x2) → new_map14(Zero, Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Zero), x2)
new_map15(Succ(y_0), x1, Succ(Succ(y_1)), x3) → new_map13(Succ(y_0), Succ(Succ(y_1)), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map14(x0, x1, x2, Succ(Succ(y_3)), Succ(Succ(y_4)), x5) → new_map14(x0, x1, x2, Succ(y_3), Succ(y_4), x5)
new_map14(x0, x1, Succ(y_2), Succ(Zero), Succ(Zero), x5) → new_map14(x0, x1, Succ(y_2), Zero, Zero, x5)
new_map13(Succ(y_4), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), x2) → new_map14(Succ(y_4), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_4)), x2)
new_map15(Zero, x1, Succ(Zero), x3) → new_map13(Zero, Succ(Zero), Succ(Zero), Succ(Zero), x3)
new_map14(x0, x1, Succ(y_2), Succ(Succ(y_3)), Succ(Zero), x5) → new_map14(x0, x1, Succ(y_2), Succ(y_3), Zero, x5)
new_map13(Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2) → new_map14(Zero, Succ(Zero), Succ(Zero), Succ(Zero), Succ(Zero), x2)
new_map15(Zero, x1, Succ(Succ(y_0)), x3) → new_map13(Zero, Succ(Succ(y_0)), Succ(Succ(y_0)), Succ(Succ(y_0)), x3)
new_map14(y0, y1, Succ(x0), Succ(y3), Zero, y4) → new_map13(y0, Succ(x0), Succ(x0), Succ(x0), y4)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map14(y0, y1, Succ(x0), Succ(y3), Zero, y4) → new_map13(y0, Succ(x0), Succ(x0), Succ(x0), y4) we obtained the following new rules:

new_map14(Succ(y_0), x1, Succ(Succ(y_1)), Succ(x3), Zero, x4) → new_map13(Succ(y_0), Succ(Succ(y_1)), Succ(Succ(y_1)), Succ(Succ(y_1)), x4)
new_map14(Zero, x1, Succ(Succ(y_0)), Succ(x3), Zero, x4) → new_map13(Zero, Succ(Succ(y_0)), Succ(Succ(y_0)), Succ(Succ(y_0)), x4)
new_map14(Zero, x1, Succ(Zero), Succ(x3), Zero, x4) → new_map13(Zero, Succ(Zero), Succ(Zero), Succ(Zero), x4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ UsableRulesProof

                          ↳ QDP

                            ↳ Narrowing

                              ↳ QDP

                                ↳ DependencyGraphProof

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ QDP

                                                    ↳ UsableRulesProof

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ UsableRulesProof

                                                                  ↳ QDP

                                                                    ↳ QReductionProof

                                                                      ↳ QDP

                                                                        ↳ Instantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                                                                                      ↳ QDP

                                                                                        ↳ ForwardInstantiation

                                                                                          ↳ QDP

                                                                                            ↳ ForwardInstantiation

                                                                                              ↳ QDP

                                                                                                ↳ NonTerminationProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map14(x0, x1, Succ(y_2), Zero, Zero, x3) → new_map15(x0, x1, Succ(y_2), x3)
new_map14(x0, x1, x2, Succ(Succ(y_3)), Succ(Succ(y_4)), x5) → new_map14(x0, x1, x2, Succ(y_3), Succ(y_4), x5)
new_map14(Zero, x1, Succ(Succ(y_0)), Succ(x3), Zero, x4) → new_map13(Zero, Succ(Succ(y_0)), Succ(Succ(y_0)), Succ(Succ(y_0)), x4)
new_map15(Zero, x1, Succ(Zero), x3) → new_map13(Zero, Succ(Zero), Succ(Zero), Succ(Zero), x3)
new_map13(Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2) → new_map14(Zero, Succ(Zero), Succ(Zero), Succ(Zero), Succ(Zero), x2)
new_map15(Zero, x1, Succ(Succ(y_0)), x3) → new_map13(Zero, Succ(Succ(y_0)), Succ(Succ(y_0)), Succ(Succ(y_0)), x3)
new_map13(Zero, Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), x2) → new_map14(Zero, Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Zero), x2)
new_map14(Succ(y_0), x1, Succ(Succ(y_1)), Succ(x3), Zero, x4) → new_map13(Succ(y_0), Succ(Succ(y_1)), Succ(Succ(y_1)), Succ(Succ(y_1)), x4)
new_map15(Succ(y_0), x1, Succ(Succ(y_1)), x3) → new_map13(Succ(y_0), Succ(Succ(y_1)), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map14(x0, x1, Succ(y_2), Succ(Zero), Succ(Zero), x5) → new_map14(x0, x1, Succ(y_2), Zero, Zero, x5)
new_map13(Succ(y_4), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), x2) → new_map14(Succ(y_4), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_4)), x2)
new_map14(x0, x1, Succ(y_2), Succ(Succ(y_3)), Succ(Zero), x5) → new_map14(x0, x1, Succ(y_2), Succ(y_3), Zero, x5)
new_map14(Zero, x1, Succ(Zero), Succ(x3), Zero, x4) → new_map13(Zero, Succ(Zero), Succ(Zero), Succ(Zero), x4)

The TRS R consists of the following rules:none

s = new_map13(Zero, Succ(Succ(y_3')), Succ(Succ(y_3')), Succ(Succ(y_3')), x2) evaluates to t =new_map13(Zero, Succ(Succ(y_3')), Succ(Succ(y_3')), Succ(Succ(y_3')), x2)

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:

Semiunifier: [ ]
Matcher: [ ]

Rewriting sequence

new_map13(Zero, Succ(Succ(y_3')), Succ(Succ(y_3')), Succ(Succ(y_3')), x2) → new_map14(Zero, Succ(Succ(y_3')), Succ(Succ(y_3')), Succ(Succ(y_3')), Succ(Zero), x2)
with rule new_map13(Zero, Succ(Succ(y_3'')), Succ(Succ(y_3'')), Succ(Succ(y_3'')), x2') → new_map14(Zero, Succ(Succ(y_3'')), Succ(Succ(y_3'')), Succ(Succ(y_3'')), Succ(Zero), x2') at position [] and matcher [y_3'' / y_3', x2' / x2]

new_map14(Zero, Succ(Succ(y_3')), Succ(Succ(y_3')), Succ(Succ(y_3')), Succ(Zero), x2) → new_map14(Zero, Succ(Succ(y_3')), Succ(Succ(y_3')), Succ(y_3'), Zero, x2)
with rule new_map14(x0, x1', Succ(y_2), Succ(Succ(y_3)), Succ(Zero), x5) → new_map14(x0, x1', Succ(y_2), Succ(y_3), Zero, x5) at position [] and matcher [y_2 / Succ(y_3'), x1' / Succ(Succ(y_3')), y_3 / y_3', x5 / x2, x0 / Zero]

new_map14(Zero, Succ(Succ(y_3')), Succ(Succ(y_3')), Succ(y_3'), Zero, x2) → new_map13(Zero, Succ(Succ(y_3')), Succ(Succ(y_3')), Succ(Succ(y_3')), x2)
with rule new_map14(Zero, x1, Succ(Succ(y_0)), Succ(x3), Zero, x4) → new_map13(Zero, Succ(Succ(y_0)), Succ(Succ(y_0)), Succ(Succ(y_0)), x4)

Now applying the matcher to the start term leads to a term which is equal to the last term in the rewriting sequence

All these steps are and every following step will be a correct step w.r.t to Q.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map17(wy323, Succ(wy3240), Zero, wy326, bb) → new_map18(wy323, wy3240, wy326, Succ(wy3240), Succ(wy323), bb)
new_map18(wy422, wy423, wy424, Succ(wy4250), Succ(wy4260), bc) → new_map18(wy422, wy423, wy424, wy4250, wy4260, bc)
new_map18(wy422, wy423, wy424, Succ(wy4250), Zero, bc) → new_map16(wy422, wy424, wy423, bc)
new_map19(wy422, wy423, wy424, bc) → new_map16(wy422, wy424, wy423, bc)
new_map17(wy323, Succ(wy3240), Succ(wy3250), wy326, bb) → new_map17(wy323, wy3240, wy3250, wy326, bb)
new_map16(wy276, wy2780, wy279, ba) → new_map17(wy276, Succ(wy279), Succ(wy2780), wy2780, ba)
new_map18(wy422, wy423, wy424, Zero, Zero, bc) → new_map19(wy422, wy423, wy424, bc)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_map17(wy323, Succ(wy3240), Succ(wy3250), wy326, bb) → new_map17(wy323, wy3240, wy3250, wy326, bb)

The remaining pairs can at least be oriented weakly.

new_map17(wy323, Succ(wy3240), Zero, wy326, bb) → new_map18(wy323, wy3240, wy326, Succ(wy3240), Succ(wy323), bb)
new_map18(wy422, wy423, wy424, Succ(wy4250), Succ(wy4260), bc) → new_map18(wy422, wy423, wy424, wy4250, wy4260, bc)
new_map18(wy422, wy423, wy424, Succ(wy4250), Zero, bc) → new_map16(wy422, wy424, wy423, bc)
new_map19(wy422, wy423, wy424, bc) → new_map16(wy422, wy424, wy423, bc)
new_map16(wy276, wy2780, wy279, ba) → new_map17(wy276, Succ(wy279), Succ(wy2780), wy2780, ba)
new_map18(wy422, wy423, wy424, Zero, Zero, bc) → new_map19(wy422, wy423, wy424, bc)

Used ordering: Polynomial interpretation [25]:

POL(Succ(x₁)) = 1 + x₁
POL(Zero) = 0
POL(new_map16(x₁, x₂, x₃, x₄)) = 1 + x₃
POL(new_map17(x₁, x₂, x₃, x₄, x₅)) = x₂
POL(new_map18(x₁, x₂, x₃, x₄, x₅, x₆)) = 1 + x₂
POL(new_map19(x₁, x₂, x₃, x₄)) = 1 + x₂

The following usable rules [17] were oriented: none

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ DependencyGraphProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map17(wy323, Succ(wy3240), Zero, wy326, bb) → new_map18(wy323, wy3240, wy326, Succ(wy3240), Succ(wy323), bb)
new_map18(wy422, wy423, wy424, Succ(wy4250), Succ(wy4260), bc) → new_map18(wy422, wy423, wy424, wy4250, wy4260, bc)
new_map18(wy422, wy423, wy424, Succ(wy4250), Zero, bc) → new_map16(wy422, wy424, wy423, bc)
new_map19(wy422, wy423, wy424, bc) → new_map16(wy422, wy424, wy423, bc)
new_map18(wy422, wy423, wy424, Zero, Zero, bc) → new_map19(wy422, wy423, wy424, bc)
new_map16(wy276, wy2780, wy279, ba) → new_map17(wy276, Succ(wy279), Succ(wy2780), wy2780, ba)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 5 less nodes.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ DependencyGraphProof

                          ↳ QDP

                            ↳ QDPSizeChangeProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map18(wy422, wy423, wy424, Succ(wy4250), Succ(wy4260), bc) → new_map18(wy422, wy423, wy424, wy4250, wy4260, bc)

From the DPs we obtained the following set of size-change graphs:

new_map18(wy422, wy423, wy424, Succ(wy4250), Succ(wy4260), bc) → new_map18(wy422, wy423, wy424, wy4250, wy4260, bc)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 > 4, 5 > 5, 6 >= 6

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map21(wy339, wy340, wy341, wy342, Succ(wy3430), Zero, bb) → new_map20(wy339, new_primPlusNat0(Succ(wy341), wy342), wy341, new_primPlusNat0(Succ(wy341), wy342), new_primPlusNat0(Succ(wy341), wy342), bb)
new_map22(wy339, wy340, wy341, wy342, bb) → new_map20(wy339, new_primPlusNat0(Succ(wy341), wy342), wy341, new_primPlusNat0(Succ(wy341), wy342), new_primPlusNat0(Succ(wy341), wy342), bb)
new_map21(wy339, wy340, wy341, wy342, Succ(wy3430), Succ(wy3440), bb) → new_map21(wy339, wy340, wy341, wy342, wy3430, wy3440, bb)
new_map21(wy339, wy340, wy341, wy342, Zero, Zero, bb) → new_map22(wy339, wy340, wy341, wy342, bb)
new_map20(wy276, wy280, wy2770, wy281, Zero, ba) → new_map21(wy276, wy280, wy2770, wy281, Zero, Succ(wy276), ba)
new_map20(wy276, wy280, wy2770, wy281, Succ(wy2820), ba) → new_map21(wy276, wy280, wy2770, wy281, Succ(wy2820), Succ(wy276), ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ Narrowing

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map22(wy339, wy340, wy341, wy342, bb) → new_map20(wy339, new_primPlusNat0(Succ(wy341), wy342), wy341, new_primPlusNat0(Succ(wy341), wy342), new_primPlusNat0(Succ(wy341), wy342), bb)
new_map21(wy339, wy340, wy341, wy342, Succ(wy3430), Zero, bb) → new_map20(wy339, new_primPlusNat0(Succ(wy341), wy342), wy341, new_primPlusNat0(Succ(wy341), wy342), new_primPlusNat0(Succ(wy341), wy342), bb)
new_map21(wy339, wy340, wy341, wy342, Zero, Zero, bb) → new_map22(wy339, wy340, wy341, wy342, bb)
new_map21(wy339, wy340, wy341, wy342, Succ(wy3430), Succ(wy3440), bb) → new_map21(wy339, wy340, wy341, wy342, wy3430, wy3440, bb)
new_map20(wy276, wy280, wy2770, wy281, Succ(wy2820), ba) → new_map21(wy276, wy280, wy2770, wy281, Succ(wy2820), Succ(wy276), ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule new_map21(wy339, wy340, wy341, wy342, Succ(wy3430), Zero, bb) → new_map20(wy339, new_primPlusNat0(Succ(wy341), wy342), wy341, new_primPlusNat0(Succ(wy341), wy342), new_primPlusNat0(Succ(wy341), wy342), bb) at position [4] we obtained the following new rules:

new_map21(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map20(y0, new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map21(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map20(y0, new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map22(wy339, wy340, wy341, wy342, bb) → new_map20(wy339, new_primPlusNat0(Succ(wy341), wy342), wy341, new_primPlusNat0(Succ(wy341), wy342), new_primPlusNat0(Succ(wy341), wy342), bb)
new_map21(wy339, wy340, wy341, wy342, Succ(wy3430), Succ(wy3440), bb) → new_map21(wy339, wy340, wy341, wy342, wy3430, wy3440, bb)
new_map21(wy339, wy340, wy341, wy342, Zero, Zero, bb) → new_map22(wy339, wy340, wy341, wy342, bb)
new_map21(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map20(y0, new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5)
new_map21(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map20(y0, new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map20(wy276, wy280, wy2770, wy281, Succ(wy2820), ba) → new_map21(wy276, wy280, wy2770, wy281, Succ(wy2820), Succ(wy276), ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map21(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map20(y0, new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5) at position [1] we obtained the following new rules:

new_map21(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map22(wy339, wy340, wy341, wy342, bb) → new_map20(wy339, new_primPlusNat0(Succ(wy341), wy342), wy341, new_primPlusNat0(Succ(wy341), wy342), new_primPlusNat0(Succ(wy341), wy342), bb)
new_map21(wy339, wy340, wy341, wy342, Zero, Zero, bb) → new_map22(wy339, wy340, wy341, wy342, bb)
new_map21(wy339, wy340, wy341, wy342, Succ(wy3430), Succ(wy3440), bb) → new_map21(wy339, wy340, wy341, wy342, wy3430, wy3440, bb)
new_map21(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map21(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map20(y0, new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5)
new_map20(wy276, wy280, wy2770, wy281, Succ(wy2820), ba) → new_map21(wy276, wy280, wy2770, wy281, Succ(wy2820), Succ(wy276), ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map21(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map20(y0, new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5) at position [1] we obtained the following new rules:

new_map21(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map20(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map22(wy339, wy340, wy341, wy342, bb) → new_map20(wy339, new_primPlusNat0(Succ(wy341), wy342), wy341, new_primPlusNat0(Succ(wy341), wy342), new_primPlusNat0(Succ(wy341), wy342), bb)
new_map21(wy339, wy340, wy341, wy342, Succ(wy3430), Succ(wy3440), bb) → new_map21(wy339, wy340, wy341, wy342, wy3430, wy3440, bb)
new_map21(wy339, wy340, wy341, wy342, Zero, Zero, bb) → new_map22(wy339, wy340, wy341, wy342, bb)
new_map21(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map21(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map20(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5)
new_map20(wy276, wy280, wy2770, wy281, Succ(wy2820), ba) → new_map21(wy276, wy280, wy2770, wy281, Succ(wy2820), Succ(wy276), ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map21(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5) at position [3] we obtained the following new rules:

new_map21(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map22(wy339, wy340, wy341, wy342, bb) → new_map20(wy339, new_primPlusNat0(Succ(wy341), wy342), wy341, new_primPlusNat0(Succ(wy341), wy342), new_primPlusNat0(Succ(wy341), wy342), bb)
new_map21(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map21(wy339, wy340, wy341, wy342, Zero, Zero, bb) → new_map22(wy339, wy340, wy341, wy342, bb)
new_map21(wy339, wy340, wy341, wy342, Succ(wy3430), Succ(wy3440), bb) → new_map21(wy339, wy340, wy341, wy342, wy3430, wy3440, bb)
new_map21(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map20(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5)
new_map20(wy276, wy280, wy2770, wy281, Succ(wy2820), ba) → new_map21(wy276, wy280, wy2770, wy281, Succ(wy2820), Succ(wy276), ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map21(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map20(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5) at position [3] we obtained the following new rules:

new_map21(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map20(y0, Succ(x0), x0, Succ(x0), Succ(x0), y5)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map22(wy339, wy340, wy341, wy342, bb) → new_map20(wy339, new_primPlusNat0(Succ(wy341), wy342), wy341, new_primPlusNat0(Succ(wy341), wy342), new_primPlusNat0(Succ(wy341), wy342), bb)
new_map21(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map21(wy339, wy340, wy341, wy342, Succ(wy3430), Succ(wy3440), bb) → new_map21(wy339, wy340, wy341, wy342, wy3430, wy3440, bb)
new_map21(wy339, wy340, wy341, wy342, Zero, Zero, bb) → new_map22(wy339, wy340, wy341, wy342, bb)
new_map21(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map20(y0, Succ(x0), x0, Succ(x0), Succ(x0), y5)
new_map20(wy276, wy280, wy2770, wy281, Succ(wy2820), ba) → new_map21(wy276, wy280, wy2770, wy281, Succ(wy2820), Succ(wy276), ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule new_map22(wy339, wy340, wy341, wy342, bb) → new_map20(wy339, new_primPlusNat0(Succ(wy341), wy342), wy341, new_primPlusNat0(Succ(wy341), wy342), new_primPlusNat0(Succ(wy341), wy342), bb) at position [4] we obtained the following new rules:

new_map22(y0, y1, x0, Succ(x1), y4) → new_map20(y0, new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map22(y0, y1, x0, Zero, y4) → new_map20(y0, new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map21(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map21(wy339, wy340, wy341, wy342, Zero, Zero, bb) → new_map22(wy339, wy340, wy341, wy342, bb)
new_map21(wy339, wy340, wy341, wy342, Succ(wy3430), Succ(wy3440), bb) → new_map21(wy339, wy340, wy341, wy342, wy3430, wy3440, bb)
new_map21(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map20(y0, Succ(x0), x0, Succ(x0), Succ(x0), y5)
new_map22(y0, y1, x0, Succ(x1), y4) → new_map20(y0, new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map22(y0, y1, x0, Zero, y4) → new_map20(y0, new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y4)
new_map20(wy276, wy280, wy2770, wy281, Succ(wy2820), ba) → new_map21(wy276, wy280, wy2770, wy281, Succ(wy2820), Succ(wy276), ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map22(y0, y1, x0, Succ(x1), y4) → new_map20(y0, new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y4) at position [1] we obtained the following new rules:

new_map22(y0, y1, x0, Succ(x1), y4) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map21(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map21(wy339, wy340, wy341, wy342, Succ(wy3430), Succ(wy3440), bb) → new_map21(wy339, wy340, wy341, wy342, wy3430, wy3440, bb)
new_map21(wy339, wy340, wy341, wy342, Zero, Zero, bb) → new_map22(wy339, wy340, wy341, wy342, bb)
new_map21(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map20(y0, Succ(x0), x0, Succ(x0), Succ(x0), y5)
new_map22(y0, y1, x0, Zero, y4) → new_map20(y0, new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y4)
new_map22(y0, y1, x0, Succ(x1), y4) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map20(wy276, wy280, wy2770, wy281, Succ(wy2820), ba) → new_map21(wy276, wy280, wy2770, wy281, Succ(wy2820), Succ(wy276), ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map22(y0, y1, x0, Zero, y4) → new_map20(y0, new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y4) at position [1] we obtained the following new rules:

new_map22(y0, y1, x0, Zero, y4) → new_map20(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map21(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map22(y0, y1, x0, Zero, y4) → new_map20(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y4)
new_map21(wy339, wy340, wy341, wy342, Zero, Zero, bb) → new_map22(wy339, wy340, wy341, wy342, bb)
new_map21(wy339, wy340, wy341, wy342, Succ(wy3430), Succ(wy3440), bb) → new_map21(wy339, wy340, wy341, wy342, wy3430, wy3440, bb)
new_map21(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map20(y0, Succ(x0), x0, Succ(x0), Succ(x0), y5)
new_map20(wy276, wy280, wy2770, wy281, Succ(wy2820), ba) → new_map21(wy276, wy280, wy2770, wy281, Succ(wy2820), Succ(wy276), ba)
new_map22(y0, y1, x0, Succ(x1), y4) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y4)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map22(y0, y1, x0, Succ(x1), y4) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y4) at position [3] we obtained the following new rules:

new_map22(y0, y1, x0, Succ(x1), y4) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map21(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map22(y0, y1, x0, Zero, y4) → new_map20(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y4)
new_map21(wy339, wy340, wy341, wy342, Succ(wy3430), Succ(wy3440), bb) → new_map21(wy339, wy340, wy341, wy342, wy3430, wy3440, bb)
new_map21(wy339, wy340, wy341, wy342, Zero, Zero, bb) → new_map22(wy339, wy340, wy341, wy342, bb)
new_map22(y0, y1, x0, Succ(x1), y4) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map21(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map20(y0, Succ(x0), x0, Succ(x0), Succ(x0), y5)
new_map20(wy276, wy280, wy2770, wy281, Succ(wy2820), ba) → new_map21(wy276, wy280, wy2770, wy281, Succ(wy2820), Succ(wy276), ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map22(y0, y1, x0, Zero, y4) → new_map20(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y4) at position [3] we obtained the following new rules:

new_map22(y0, y1, x0, Zero, y4) → new_map20(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Instantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map21(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map21(wy339, wy340, wy341, wy342, Zero, Zero, bb) → new_map22(wy339, wy340, wy341, wy342, bb)
new_map21(wy339, wy340, wy341, wy342, Succ(wy3430), Succ(wy3440), bb) → new_map21(wy339, wy340, wy341, wy342, wy3430, wy3440, bb)
new_map22(y0, y1, x0, Succ(x1), y4) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map21(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map20(y0, Succ(x0), x0, Succ(x0), Succ(x0), y5)
new_map20(wy276, wy280, wy2770, wy281, Succ(wy2820), ba) → new_map21(wy276, wy280, wy2770, wy281, Succ(wy2820), Succ(wy276), ba)
new_map22(y0, y1, x0, Zero, y4) → new_map20(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_map20(wy276, wy280, wy2770, wy281, Succ(wy2820), ba) → new_map21(wy276, wy280, wy2770, wy281, Succ(wy2820), Succ(wy276), ba) we obtained the following new rules:

new_map20(z0, Succ(z2), z2, Succ(z2), Succ(z2), z4) → new_map21(z0, Succ(z2), z2, Succ(z2), Succ(z2), Succ(z0), z4)
new_map20(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z5) → new_map21(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), Succ(z0), z5)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ ForwardInstantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map21(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map21(wy339, wy340, wy341, wy342, Succ(wy3430), Succ(wy3440), bb) → new_map21(wy339, wy340, wy341, wy342, wy3430, wy3440, bb)
new_map21(wy339, wy340, wy341, wy342, Zero, Zero, bb) → new_map22(wy339, wy340, wy341, wy342, bb)
new_map22(y0, y1, x0, Succ(x1), y4) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map21(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map20(y0, Succ(x0), x0, Succ(x0), Succ(x0), y5)
new_map20(z0, Succ(z2), z2, Succ(z2), Succ(z2), z4) → new_map21(z0, Succ(z2), z2, Succ(z2), Succ(z2), Succ(z0), z4)
new_map20(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z5) → new_map21(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), Succ(z0), z5)
new_map22(y0, y1, x0, Zero, y4) → new_map20(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map21(wy339, wy340, wy341, wy342, Succ(wy3430), Succ(wy3440), bb) → new_map21(wy339, wy340, wy341, wy342, wy3430, wy3440, bb) we obtained the following new rules:

new_map21(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map21(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map21(x0, x1, x2, Succ(y_3), Succ(Succ(y_4)), Succ(Zero), x6) → new_map21(x0, x1, x2, Succ(y_3), Succ(y_4), Zero, x6)
new_map21(x0, x1, x2, Zero, Succ(Succ(y_3)), Succ(Zero), x6) → new_map21(x0, x1, x2, Zero, Succ(y_3), Zero, x6)
new_map21(x0, x1, x2, x3, Succ(Zero), Succ(Zero), x6) → new_map21(x0, x1, x2, x3, Zero, Zero, x6)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ ForwardInstantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map21(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map21(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map21(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map21(x0, x1, x2, Succ(y_3), Succ(Succ(y_4)), Succ(Zero), x6) → new_map21(x0, x1, x2, Succ(y_3), Succ(y_4), Zero, x6)
new_map21(wy339, wy340, wy341, wy342, Zero, Zero, bb) → new_map22(wy339, wy340, wy341, wy342, bb)
new_map22(y0, y1, x0, Succ(x1), y4) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map21(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map20(y0, Succ(x0), x0, Succ(x0), Succ(x0), y5)
new_map20(z0, Succ(z2), z2, Succ(z2), Succ(z2), z4) → new_map21(z0, Succ(z2), z2, Succ(z2), Succ(z2), Succ(z0), z4)
new_map20(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z5) → new_map21(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), Succ(z0), z5)
new_map21(x0, x1, x2, x3, Succ(Zero), Succ(Zero), x6) → new_map21(x0, x1, x2, x3, Zero, Zero, x6)
new_map21(x0, x1, x2, Zero, Succ(Succ(y_3)), Succ(Zero), x6) → new_map21(x0, x1, x2, Zero, Succ(y_3), Zero, x6)
new_map22(y0, y1, x0, Zero, y4) → new_map20(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map21(wy339, wy340, wy341, wy342, Zero, Zero, bb) → new_map22(wy339, wy340, wy341, wy342, bb) we obtained the following new rules:

new_map21(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map22(x0, x1, x2, Succ(y_3), x4)
new_map21(x0, x1, x2, Zero, Zero, Zero, x4) → new_map22(x0, x1, x2, Zero, x4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ ForwardInstantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map21(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map21(x0, x1, x2, Zero, Zero, Zero, x4) → new_map22(x0, x1, x2, Zero, x4)
new_map20(z0, Succ(z2), z2, Succ(z2), Succ(z2), z4) → new_map21(z0, Succ(z2), z2, Succ(z2), Succ(z2), Succ(z0), z4)
new_map20(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z5) → new_map21(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), Succ(z0), z5)
new_map21(x0, x1, x2, x3, Succ(Zero), Succ(Zero), x6) → new_map21(x0, x1, x2, x3, Zero, Zero, x6)
new_map22(y0, y1, x0, Zero, y4) → new_map20(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4)
new_map21(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map21(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map21(x0, x1, x2, Succ(y_3), Succ(Succ(y_4)), Succ(Zero), x6) → new_map21(x0, x1, x2, Succ(y_3), Succ(y_4), Zero, x6)
new_map21(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map22(x0, x1, x2, Succ(y_3), x4)
new_map22(y0, y1, x0, Succ(x1), y4) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map21(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map20(y0, Succ(x0), x0, Succ(x0), Succ(x0), y5)
new_map21(x0, x1, x2, Zero, Succ(Succ(y_3)), Succ(Zero), x6) → new_map21(x0, x1, x2, Zero, Succ(y_3), Zero, x6)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map20(z0, Succ(z2), z2, Succ(z2), Succ(z2), z4) → new_map21(z0, Succ(z2), z2, Succ(z2), Succ(z2), Succ(z0), z4) we obtained the following new rules:

new_map20(Zero, Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map21(Zero, Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Zero), x2)
new_map20(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map21(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Succ(y_5)), x2)
new_map20(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map21(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ ForwardInstantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map20(Zero, Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map21(Zero, Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Zero), x2)
new_map21(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map20(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map21(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Succ(y_5)), x2)
new_map20(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map21(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2)
new_map21(x0, x1, x2, Zero, Zero, Zero, x4) → new_map22(x0, x1, x2, Zero, x4)
new_map20(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z5) → new_map21(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), Succ(z0), z5)
new_map22(y0, y1, x0, Zero, y4) → new_map20(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4)
new_map21(x0, x1, x2, x3, Succ(Zero), Succ(Zero), x6) → new_map21(x0, x1, x2, x3, Zero, Zero, x6)
new_map21(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map21(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map21(x0, x1, x2, Succ(y_3), Succ(Succ(y_4)), Succ(Zero), x6) → new_map21(x0, x1, x2, Succ(y_3), Succ(y_4), Zero, x6)
new_map21(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map22(x0, x1, x2, Succ(y_3), x4)
new_map22(y0, y1, x0, Succ(x1), y4) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map21(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map20(y0, Succ(x0), x0, Succ(x0), Succ(x0), y5)
new_map21(x0, x1, x2, Zero, Succ(Succ(y_3)), Succ(Zero), x6) → new_map21(x0, x1, x2, Zero, Succ(y_3), Zero, x6)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map21(y0, y1, x0, Zero, Succ(y4), Zero, y5) → new_map20(y0, Succ(x0), x0, Succ(x0), Succ(x0), y5) we obtained the following new rules:

new_map21(Succ(y_0), x1, Succ(y_1), Zero, Succ(x3), Zero, x4) → new_map20(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x4)
new_map21(Zero, x1, Zero, Zero, Succ(x3), Zero, x4) → new_map20(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x4)
new_map21(x0, x1, Succ(y_1), Zero, Succ(x3), Zero, x4) → new_map20(x0, Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x4)
new_map21(Zero, x1, Succ(y_0), Zero, Succ(x3), Zero, x4) → new_map20(Zero, Succ(Succ(y_0)), Succ(y_0), Succ(Succ(y_0)), Succ(Succ(y_0)), x4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ ForwardInstantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map20(Zero, Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map21(Zero, Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Zero), x2)
new_map21(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map20(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map21(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Succ(y_5)), x2)
new_map21(x0, x1, x2, Zero, Zero, Zero, x4) → new_map22(x0, x1, x2, Zero, x4)
new_map20(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map21(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2)
new_map21(x0, x1, Succ(y_1), Zero, Succ(x3), Zero, x4) → new_map20(x0, Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x4)
new_map20(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z5) → new_map21(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), Succ(z0), z5)
new_map21(Zero, x1, Succ(y_0), Zero, Succ(x3), Zero, x4) → new_map20(Zero, Succ(Succ(y_0)), Succ(y_0), Succ(Succ(y_0)), Succ(Succ(y_0)), x4)
new_map21(x0, x1, x2, x3, Succ(Zero), Succ(Zero), x6) → new_map21(x0, x1, x2, x3, Zero, Zero, x6)
new_map22(y0, y1, x0, Zero, y4) → new_map20(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4)
new_map21(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map21(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map21(Succ(y_0), x1, Succ(y_1), Zero, Succ(x3), Zero, x4) → new_map20(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x4)
new_map21(x0, x1, x2, Succ(y_3), Succ(Succ(y_4)), Succ(Zero), x6) → new_map21(x0, x1, x2, Succ(y_3), Succ(y_4), Zero, x6)
new_map21(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map22(x0, x1, x2, Succ(y_3), x4)
new_map22(y0, y1, x0, Succ(x1), y4) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map21(Zero, x1, Zero, Zero, Succ(x3), Zero, x4) → new_map20(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x4)
new_map21(x0, x1, x2, Zero, Succ(Succ(y_3)), Succ(Zero), x6) → new_map21(x0, x1, x2, Zero, Succ(y_3), Zero, x6)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map22(y0, y1, x0, Zero, y4) → new_map20(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4) we obtained the following new rules:

new_map22(x0, x1, Succ(y_1), Zero, x3) → new_map20(x0, Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map22(Succ(y_0), x1, Succ(y_1), Zero, x3) → new_map20(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map22(Zero, x1, Zero, Zero, x3) → new_map20(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x3)
new_map22(Zero, x1, Succ(y_0), Zero, x3) → new_map20(Zero, Succ(Succ(y_0)), Succ(y_0), Succ(Succ(y_0)), Succ(Succ(y_0)), x3)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ ForwardInstantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                                                                                      ↳ QDP

                                                                                        ↳ ForwardInstantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map20(Zero, Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map21(Zero, Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Zero), x2)
new_map21(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map20(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map21(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Succ(y_5)), x2)
new_map20(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map21(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2)
new_map21(x0, x1, x2, Zero, Zero, Zero, x4) → new_map22(x0, x1, x2, Zero, x4)
new_map22(Succ(y_0), x1, Succ(y_1), Zero, x3) → new_map20(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map21(x0, x1, Succ(y_1), Zero, Succ(x3), Zero, x4) → new_map20(x0, Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x4)
new_map20(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z5) → new_map21(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), Succ(z0), z5)
new_map22(Zero, x1, Succ(y_0), Zero, x3) → new_map20(Zero, Succ(Succ(y_0)), Succ(y_0), Succ(Succ(y_0)), Succ(Succ(y_0)), x3)
new_map21(x0, x1, x2, x3, Succ(Zero), Succ(Zero), x6) → new_map21(x0, x1, x2, x3, Zero, Zero, x6)
new_map21(Zero, x1, Succ(y_0), Zero, Succ(x3), Zero, x4) → new_map20(Zero, Succ(Succ(y_0)), Succ(y_0), Succ(Succ(y_0)), Succ(Succ(y_0)), x4)
new_map22(x0, x1, Succ(y_1), Zero, x3) → new_map20(x0, Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map21(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map21(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map21(x0, x1, x2, Succ(y_3), Succ(Succ(y_4)), Succ(Zero), x6) → new_map21(x0, x1, x2, Succ(y_3), Succ(y_4), Zero, x6)
new_map21(Succ(y_0), x1, Succ(y_1), Zero, Succ(x3), Zero, x4) → new_map20(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x4)
new_map21(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map22(x0, x1, x2, Succ(y_3), x4)
new_map22(y0, y1, x0, Succ(x1), y4) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map21(Zero, x1, Zero, Zero, Succ(x3), Zero, x4) → new_map20(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x4)
new_map22(Zero, x1, Zero, Zero, x3) → new_map20(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x3)
new_map21(x0, x1, x2, Zero, Succ(Succ(y_3)), Succ(Zero), x6) → new_map21(x0, x1, x2, Zero, Succ(y_3), Zero, x6)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map20(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z5) → new_map21(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), Succ(z0), z5) we obtained the following new rules:

new_map20(Zero, Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map21(Zero, Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Zero), x5)
new_map20(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map21(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Succ(y_5)), x5)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ ForwardInstantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                                                                                      ↳ QDP

                                                                                        ↳ ForwardInstantiation

                                                                                          ↳ QDP

                                                                                            ↳ ForwardInstantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map20(Zero, Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map21(Zero, Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Zero), x2)
new_map21(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map20(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map21(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Succ(y_5)), x2)
new_map21(x0, x1, x2, Zero, Zero, Zero, x4) → new_map22(x0, x1, x2, Zero, x4)
new_map20(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map21(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2)
new_map22(Succ(y_0), x1, Succ(y_1), Zero, x3) → new_map20(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map21(x0, x1, Succ(y_1), Zero, Succ(x3), Zero, x4) → new_map20(x0, Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x4)
new_map20(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map21(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Succ(y_5)), x5)
new_map21(Zero, x1, Succ(y_0), Zero, Succ(x3), Zero, x4) → new_map20(Zero, Succ(Succ(y_0)), Succ(y_0), Succ(Succ(y_0)), Succ(Succ(y_0)), x4)
new_map21(x0, x1, x2, x3, Succ(Zero), Succ(Zero), x6) → new_map21(x0, x1, x2, x3, Zero, Zero, x6)
new_map22(Zero, x1, Succ(y_0), Zero, x3) → new_map20(Zero, Succ(Succ(y_0)), Succ(y_0), Succ(Succ(y_0)), Succ(Succ(y_0)), x3)
new_map22(x0, x1, Succ(y_1), Zero, x3) → new_map20(x0, Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map21(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map21(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map21(Succ(y_0), x1, Succ(y_1), Zero, Succ(x3), Zero, x4) → new_map20(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x4)
new_map21(x0, x1, x2, Succ(y_3), Succ(Succ(y_4)), Succ(Zero), x6) → new_map21(x0, x1, x2, Succ(y_3), Succ(y_4), Zero, x6)
new_map21(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map22(x0, x1, x2, Succ(y_3), x4)
new_map22(y0, y1, x0, Succ(x1), y4) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map20(Zero, Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map21(Zero, Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Zero), x5)
new_map21(Zero, x1, Zero, Zero, Succ(x3), Zero, x4) → new_map20(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x4)
new_map22(Zero, x1, Zero, Zero, x3) → new_map20(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x3)
new_map21(x0, x1, x2, Zero, Succ(Succ(y_3)), Succ(Zero), x6) → new_map21(x0, x1, x2, Zero, Succ(y_3), Zero, x6)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map21(x0, x1, Succ(y_1), Zero, Succ(x3), Zero, x4) → new_map20(x0, Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x4) we obtained the following new rules:

new_map21(Succ(y_0), x1, Succ(x2), Zero, Succ(x3), Zero, x4) → new_map20(Succ(y_0), Succ(Succ(x2)), Succ(x2), Succ(Succ(x2)), Succ(Succ(x2)), x4)
new_map21(Zero, x1, Succ(x2), Zero, Succ(x3), Zero, x4) → new_map20(Zero, Succ(Succ(x2)), Succ(x2), Succ(Succ(x2)), Succ(Succ(x2)), x4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ ForwardInstantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                                                                                      ↳ QDP

                                                                                        ↳ ForwardInstantiation

                                                                                          ↳ QDP

                                                                                            ↳ ForwardInstantiation

                                                                                              ↳ QDP

                                                                                                ↳ ForwardInstantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map20(Zero, Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map21(Zero, Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Zero), x2)
new_map21(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map20(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map21(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Succ(y_5)), x2)
new_map20(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map21(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2)
new_map21(x0, x1, x2, Zero, Zero, Zero, x4) → new_map22(x0, x1, x2, Zero, x4)
new_map22(Succ(y_0), x1, Succ(y_1), Zero, x3) → new_map20(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map22(Zero, x1, Succ(y_0), Zero, x3) → new_map20(Zero, Succ(Succ(y_0)), Succ(y_0), Succ(Succ(y_0)), Succ(Succ(y_0)), x3)
new_map21(x0, x1, x2, x3, Succ(Zero), Succ(Zero), x6) → new_map21(x0, x1, x2, x3, Zero, Zero, x6)
new_map21(Zero, x1, Succ(y_0), Zero, Succ(x3), Zero, x4) → new_map20(Zero, Succ(Succ(y_0)), Succ(y_0), Succ(Succ(y_0)), Succ(Succ(y_0)), x4)
new_map20(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map21(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Succ(y_5)), x5)
new_map22(x0, x1, Succ(y_1), Zero, x3) → new_map20(x0, Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map21(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map21(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map21(x0, x1, x2, Succ(y_3), Succ(Succ(y_4)), Succ(Zero), x6) → new_map21(x0, x1, x2, Succ(y_3), Succ(y_4), Zero, x6)
new_map21(Succ(y_0), x1, Succ(y_1), Zero, Succ(x3), Zero, x4) → new_map20(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x4)
new_map21(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map22(x0, x1, x2, Succ(y_3), x4)
new_map22(y0, y1, x0, Succ(x1), y4) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map20(Zero, Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map21(Zero, Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Zero), x5)
new_map21(Zero, x1, Zero, Zero, Succ(x3), Zero, x4) → new_map20(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x4)
new_map22(Zero, x1, Zero, Zero, x3) → new_map20(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x3)
new_map21(x0, x1, x2, Zero, Succ(Succ(y_3)), Succ(Zero), x6) → new_map21(x0, x1, x2, Zero, Succ(y_3), Zero, x6)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map22(x0, x1, Succ(y_1), Zero, x3) → new_map20(x0, Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x3) we obtained the following new rules:

new_map22(Succ(y_0), x1, Succ(x2), Zero, x3) → new_map20(Succ(y_0), Succ(Succ(x2)), Succ(x2), Succ(Succ(x2)), Succ(Succ(x2)), x3)
new_map22(Zero, x1, Succ(x2), Zero, x3) → new_map20(Zero, Succ(Succ(x2)), Succ(x2), Succ(Succ(x2)), Succ(Succ(x2)), x3)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ ForwardInstantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                                                                                      ↳ QDP

                                                                                        ↳ ForwardInstantiation

                                                                                          ↳ QDP

                                                                                            ↳ ForwardInstantiation

                                                                                              ↳ QDP

                                                                                                ↳ ForwardInstantiation

                                                                                                  ↳ QDP

                                                                                                    ↳ QDPOrderProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map20(Zero, Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map21(Zero, Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Zero), x2)
new_map21(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map20(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map21(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Succ(y_5)), x2)
new_map21(x0, x1, x2, Zero, Zero, Zero, x4) → new_map22(x0, x1, x2, Zero, x4)
new_map20(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map21(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2)
new_map22(Succ(y_0), x1, Succ(y_1), Zero, x3) → new_map20(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map20(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map21(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Succ(y_5)), x5)
new_map21(Zero, x1, Succ(y_0), Zero, Succ(x3), Zero, x4) → new_map20(Zero, Succ(Succ(y_0)), Succ(y_0), Succ(Succ(y_0)), Succ(Succ(y_0)), x4)
new_map21(x0, x1, x2, x3, Succ(Zero), Succ(Zero), x6) → new_map21(x0, x1, x2, x3, Zero, Zero, x6)
new_map22(Zero, x1, Succ(y_0), Zero, x3) → new_map20(Zero, Succ(Succ(y_0)), Succ(y_0), Succ(Succ(y_0)), Succ(Succ(y_0)), x3)
new_map21(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map21(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map21(Succ(y_0), x1, Succ(y_1), Zero, Succ(x3), Zero, x4) → new_map20(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x4)
new_map21(x0, x1, x2, Succ(y_3), Succ(Succ(y_4)), Succ(Zero), x6) → new_map21(x0, x1, x2, Succ(y_3), Succ(y_4), Zero, x6)
new_map21(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map22(x0, x1, x2, Succ(y_3), x4)
new_map22(y0, y1, x0, Succ(x1), y4) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map20(Zero, Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map21(Zero, Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Zero), x5)
new_map21(Zero, x1, Zero, Zero, Succ(x3), Zero, x4) → new_map20(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x4)
new_map22(Zero, x1, Zero, Zero, x3) → new_map20(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x3)
new_map21(x0, x1, x2, Zero, Succ(Succ(y_3)), Succ(Zero), x6) → new_map21(x0, x1, x2, Zero, Succ(y_3), Zero, x6)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_map22(Succ(y_0), x1, Succ(y_1), Zero, x3) → new_map20(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map21(Zero, x1, Succ(y_0), Zero, Succ(x3), Zero, x4) → new_map20(Zero, Succ(Succ(y_0)), Succ(y_0), Succ(Succ(y_0)), Succ(Succ(y_0)), x4)
new_map22(Zero, x1, Succ(y_0), Zero, x3) → new_map20(Zero, Succ(Succ(y_0)), Succ(y_0), Succ(Succ(y_0)), Succ(Succ(y_0)), x3)
new_map21(Succ(y_0), x1, Succ(y_1), Zero, Succ(x3), Zero, x4) → new_map20(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x4)
new_map21(Zero, x1, Zero, Zero, Succ(x3), Zero, x4) → new_map20(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x4)
new_map22(Zero, x1, Zero, Zero, x3) → new_map20(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x3)

The remaining pairs can at least be oriented weakly.

new_map20(Zero, Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map21(Zero, Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Zero), x2)
new_map21(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map20(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map21(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Succ(y_5)), x2)
new_map21(x0, x1, x2, Zero, Zero, Zero, x4) → new_map22(x0, x1, x2, Zero, x4)
new_map20(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map21(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2)
new_map20(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map21(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Succ(y_5)), x5)
new_map21(x0, x1, x2, x3, Succ(Zero), Succ(Zero), x6) → new_map21(x0, x1, x2, x3, Zero, Zero, x6)
new_map21(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map21(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map21(x0, x1, x2, Succ(y_3), Succ(Succ(y_4)), Succ(Zero), x6) → new_map21(x0, x1, x2, Succ(y_3), Succ(y_4), Zero, x6)
new_map21(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map22(x0, x1, x2, Succ(y_3), x4)
new_map22(y0, y1, x0, Succ(x1), y4) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map20(Zero, Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map21(Zero, Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Zero), x5)
new_map21(x0, x1, x2, Zero, Succ(Succ(y_3)), Succ(Zero), x6) → new_map21(x0, x1, x2, Zero, Succ(y_3), Zero, x6)

Used ordering: Polynomial interpretation [25]:

POL(Succ(x₁)) = 0
POL(Zero) = 1
POL(new_map20(x₁, x₂, x₃, x₄, x₅, x₆)) = x₃
POL(new_map21(x₁, x₂, x₃, x₄, x₅, x₆, x₇)) = x₃ + x₄
POL(new_map22(x₁, x₂, x₃, x₄, x₅)) = x₃ + x₄
POL(new_primPlusNat0(x₁, x₂)) = 0

The following usable rules [17] were oriented: none

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ ForwardInstantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                                                                                      ↳ QDP

                                                                                        ↳ ForwardInstantiation

                                                                                          ↳ QDP

                                                                                            ↳ ForwardInstantiation

                                                                                              ↳ QDP

                                                                                                ↳ ForwardInstantiation

                                                                                                  ↳ QDP

                                                                                                    ↳ QDPOrderProof

                                                                                                      ↳ QDP

                                                                                                        ↳ DependencyGraphProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map20(Zero, Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map21(Zero, Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Zero), x2)
new_map21(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map20(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map21(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Succ(y_5)), x2)
new_map21(x0, x1, x2, Zero, Zero, Zero, x4) → new_map22(x0, x1, x2, Zero, x4)
new_map20(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map21(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2)
new_map20(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map21(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Succ(y_5)), x5)
new_map21(x0, x1, x2, x3, Succ(Zero), Succ(Zero), x6) → new_map21(x0, x1, x2, x3, Zero, Zero, x6)
new_map21(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map21(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map21(x0, x1, x2, Succ(y_3), Succ(Succ(y_4)), Succ(Zero), x6) → new_map21(x0, x1, x2, Succ(y_3), Succ(y_4), Zero, x6)
new_map21(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map22(x0, x1, x2, Succ(y_3), x4)
new_map22(y0, y1, x0, Succ(x1), y4) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map20(Zero, Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map21(Zero, Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Zero), x5)
new_map21(x0, x1, x2, Zero, Succ(Succ(y_3)), Succ(Zero), x6) → new_map21(x0, x1, x2, Zero, Succ(y_3), Zero, x6)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 3 less nodes.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ ForwardInstantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                                                                                      ↳ QDP

                                                                                        ↳ ForwardInstantiation

                                                                                          ↳ QDP

                                                                                            ↳ ForwardInstantiation

                                                                                              ↳ QDP

                                                                                                ↳ ForwardInstantiation

                                                                                                  ↳ QDP

                                                                                                    ↳ QDPOrderProof

                                                                                                      ↳ QDP

                                                                                                        ↳ DependencyGraphProof

                                                                                                          ↳ QDP

                                                                                                            ↳ MNOCProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map20(Zero, Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map21(Zero, Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Zero), x2)
new_map21(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map21(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map21(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map20(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map21(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Succ(y_5)), x2)
new_map21(x0, x1, x2, Succ(y_3), Succ(Succ(y_4)), Succ(Zero), x6) → new_map21(x0, x1, x2, Succ(y_3), Succ(y_4), Zero, x6)
new_map21(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map22(x0, x1, x2, Succ(y_3), x4)
new_map22(y0, y1, x0, Succ(x1), y4) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map20(Zero, Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map21(Zero, Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Zero), x5)
new_map20(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map21(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Succ(y_5)), x5)
new_map21(x0, x1, x2, x3, Succ(Zero), Succ(Zero), x6) → new_map21(x0, x1, x2, x3, Zero, Zero, x6)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We use the modular non-overlap check [17] to decrease Q to the empty set.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ ForwardInstantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                                                                                      ↳ QDP

                                                                                        ↳ ForwardInstantiation

                                                                                          ↳ QDP

                                                                                            ↳ ForwardInstantiation

                                                                                              ↳ QDP

                                                                                                ↳ ForwardInstantiation

                                                                                                  ↳ QDP

                                                                                                    ↳ QDPOrderProof

                                                                                                      ↳ QDP

                                                                                                        ↳ DependencyGraphProof

                                                                                                          ↳ QDP

                                                                                                            ↳ MNOCProof

                                                                                                              ↳ QDP

                                                                                                                ↳ NonTerminationProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map20(Zero, Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map21(Zero, Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Zero), x2)
new_map21(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map21(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map21(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map21(x0, x1, x2, Succ(y_3), Succ(Succ(y_4)), Succ(Zero), x6) → new_map21(x0, x1, x2, Succ(y_3), Succ(y_4), Zero, x6)
new_map20(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map21(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Succ(y_5)), x2)
new_map21(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map22(x0, x1, x2, Succ(y_3), x4)
new_map22(y0, y1, x0, Succ(x1), y4) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map20(Zero, Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map21(Zero, Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Zero), x5)
new_map21(x0, x1, x2, x3, Succ(Zero), Succ(Zero), x6) → new_map21(x0, x1, x2, x3, Zero, Zero, x6)
new_map20(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map21(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Succ(y_5)), x5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

new_map20(Zero, Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map21(Zero, Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Zero), x2)
new_map21(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map21(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map21(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map21(x0, x1, x2, Succ(y_3), Succ(Succ(y_4)), Succ(Zero), x6) → new_map21(x0, x1, x2, Succ(y_3), Succ(y_4), Zero, x6)
new_map20(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map21(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Succ(y_5)), x2)
new_map21(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map22(x0, x1, x2, Succ(y_3), x4)
new_map22(y0, y1, x0, Succ(x1), y4) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map20(Zero, Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map21(Zero, Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Zero), x5)
new_map21(x0, x1, x2, x3, Succ(Zero), Succ(Zero), x6) → new_map21(x0, x1, x2, x3, Zero, Zero, x6)
new_map20(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map21(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Succ(y_5)), x5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

s = new_map20(Zero, Succ(Succ(x1)), x2', Succ(Succ(x3)), Succ(Succ(x4)), x5) evaluates to t =new_map20(Zero, Succ(Succ(new_primPlusNat0(x2', Succ(x3)))), x2', Succ(Succ(new_primPlusNat0(x2', Succ(x3)))), Succ(Succ(new_primPlusNat0(x2', Succ(x3)))), x5)

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:

Matcher: [x1 / new_primPlusNat0(x2', Succ(x3)), x4 / new_primPlusNat0(x2', Succ(x3)), x3 / new_primPlusNat0(x2', Succ(x3))]
Semiunifier: [ ]

Rewriting sequence

new_map20(Zero, Succ(Succ(x1)), x2', Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map21(Zero, Succ(Succ(x1)), x2', Succ(Succ(x3)), Succ(Succ(x4)), Succ(Zero), x5)
with rule new_map20(Zero, Succ(Succ(x1')), x2'', Succ(Succ(x3')), Succ(Succ(x4')), x5') → new_map21(Zero, Succ(Succ(x1')), x2'', Succ(Succ(x3')), Succ(Succ(x4')), Succ(Zero), x5') at position [] and matcher [x2'' / x2', x1' / x1, x4' / x4, x3' / x3, x5' / x5]

new_map21(Zero, Succ(Succ(x1)), x2', Succ(Succ(x3)), Succ(Succ(x4)), Succ(Zero), x5) → new_map21(Zero, Succ(Succ(x1)), x2', Succ(Succ(x3)), Succ(x4), Zero, x5)
with rule new_map21(x0', x1', x2, Succ(y_3), Succ(Succ(y_4)), Succ(Zero), x6) → new_map21(x0', x1', x2, Succ(y_3), Succ(y_4), Zero, x6) at position [] and matcher [x6 / x5, y_4 / x4, x1' / Succ(Succ(x1)), y_3 / Succ(x3), x0' / Zero, x2 / x2']

new_map21(Zero, Succ(Succ(x1)), x2', Succ(Succ(x3)), Succ(x4), Zero, x5) → new_map20(Zero, Succ(Succ(new_primPlusNat0(x2', Succ(x3)))), x2', Succ(Succ(new_primPlusNat0(x2', Succ(x3)))), Succ(Succ(new_primPlusNat0(x2', Succ(x3)))), x5)
with rule new_map21(y0, y1, x0, Succ(x1), Succ(y4), Zero, y5) → new_map20(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)

Now applying the matcher to the start term leads to a term which is equal to the last term in the rewriting sequence

All these steps are and every following step will be a correct step w.r.t to Q.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPSizeChangeProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map23(wy276, Succ(wy2770), Succ(wy2780), wy279, ba) → new_map23(wy276, wy2770, wy2780, wy279, ba)

From the DPs we obtained the following set of size-change graphs:

new_map23(wy276, Succ(wy2770), Succ(wy2780), wy279, ba) → new_map23(wy276, wy2770, wy2780, wy279, ba)
The graph contains the following edges 1 >= 1, 2 > 2, 3 > 3, 4 >= 4, 5 >= 5

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map24(wy306, wy359, wy309, wy360, Zero, ba) → new_map25(wy306, wy359, wy309, wy360, ba)
new_map25(wy306, wy359, wy309, wy360, ba) → new_map24(wy306, new_primPlusNat0(Succ(wy309), wy360), wy309, new_primPlusNat0(Succ(wy309), wy360), new_primPlusNat0(Succ(wy309), wy360), ba)
new_map24(wy306, wy359, wy309, wy360, Succ(wy3610), ba) → new_map24(wy306, new_primPlusNat0(Succ(wy309), wy360), wy309, new_primPlusNat0(Succ(wy309), wy360), new_primPlusNat0(Succ(wy309), wy360), ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_map25(wy306, wy359, wy309, wy360, ba) → new_map24(wy306, new_primPlusNat0(Succ(wy309), wy360), wy309, new_primPlusNat0(Succ(wy309), wy360), new_primPlusNat0(Succ(wy309), wy360), ba)

The remaining pairs can at least be oriented weakly.

new_map24(wy306, wy359, wy309, wy360, Zero, ba) → new_map25(wy306, wy359, wy309, wy360, ba)
new_map24(wy306, wy359, wy309, wy360, Succ(wy3610), ba) → new_map24(wy306, new_primPlusNat0(Succ(wy309), wy360), wy309, new_primPlusNat0(Succ(wy309), wy360), new_primPlusNat0(Succ(wy309), wy360), ba)

Used ordering: Polynomial interpretation [25]:

POL(Succ(x₁)) = 0
POL(Zero) = 1
POL(new_map24(x₁, x₂, x₃, x₄, x₅, x₆)) = x₅
POL(new_map25(x₁, x₂, x₃, x₄, x₅)) = 1
POL(new_primPlusNat0(x₁, x₂)) = 0

The following usable rules [17] were oriented:

new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ DependencyGraphProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map24(wy306, wy359, wy309, wy360, Zero, ba) → new_map25(wy306, wy359, wy309, wy360, ba)
new_map24(wy306, wy359, wy309, wy360, Succ(wy3610), ba) → new_map24(wy306, new_primPlusNat0(Succ(wy309), wy360), wy309, new_primPlusNat0(Succ(wy309), wy360), new_primPlusNat0(Succ(wy309), wy360), ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ DependencyGraphProof

                          ↳ QDP

                            ↳ Narrowing

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map24(wy306, wy359, wy309, wy360, Succ(wy3610), ba) → new_map24(wy306, new_primPlusNat0(Succ(wy309), wy360), wy309, new_primPlusNat0(Succ(wy309), wy360), new_primPlusNat0(Succ(wy309), wy360), ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule new_map24(wy306, wy359, wy309, wy360, Succ(wy3610), ba) → new_map24(wy306, new_primPlusNat0(Succ(wy309), wy360), wy309, new_primPlusNat0(Succ(wy309), wy360), new_primPlusNat0(Succ(wy309), wy360), ba) at position [4] we obtained the following new rules:

new_map24(y0, y1, x0, Zero, Succ(y4), y5) → new_map24(y0, new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5)
new_map24(y0, y1, x0, Succ(x1), Succ(y4), y5) → new_map24(y0, new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ DependencyGraphProof

                          ↳ QDP

                            ↳ Narrowing

                              ↳ QDP

                                ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map24(y0, y1, x0, Succ(x1), Succ(y4), y5) → new_map24(y0, new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map24(y0, y1, x0, Zero, Succ(y4), y5) → new_map24(y0, new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map24(y0, y1, x0, Zero, Succ(y4), y5) → new_map24(y0, new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5) at position [1] we obtained the following new rules:

new_map24(y0, y1, x0, Zero, Succ(y4), y5) → new_map24(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ DependencyGraphProof

                          ↳ QDP

                            ↳ Narrowing

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map24(y0, y1, x0, Zero, Succ(y4), y5) → new_map24(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5)
new_map24(y0, y1, x0, Succ(x1), Succ(y4), y5) → new_map24(y0, new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map24(y0, y1, x0, Succ(x1), Succ(y4), y5) → new_map24(y0, new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5) at position [1] we obtained the following new rules:

new_map24(y0, y1, x0, Succ(x1), Succ(y4), y5) → new_map24(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ DependencyGraphProof

                          ↳ QDP

                            ↳ Narrowing

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map24(y0, y1, x0, Zero, Succ(y4), y5) → new_map24(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5)
new_map24(y0, y1, x0, Succ(x1), Succ(y4), y5) → new_map24(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map24(y0, y1, x0, Zero, Succ(y4), y5) → new_map24(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5) at position [3] we obtained the following new rules:

new_map24(y0, y1, x0, Zero, Succ(y4), y5) → new_map24(y0, Succ(x0), x0, Succ(x0), Succ(x0), y5)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ DependencyGraphProof

                          ↳ QDP

                            ↳ Narrowing

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map24(y0, y1, x0, Zero, Succ(y4), y5) → new_map24(y0, Succ(x0), x0, Succ(x0), Succ(x0), y5)
new_map24(y0, y1, x0, Succ(x1), Succ(y4), y5) → new_map24(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map24(y0, y1, x0, Succ(x1), Succ(y4), y5) → new_map24(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5) at position [3] we obtained the following new rules:

new_map24(y0, y1, x0, Succ(x1), Succ(y4), y5) → new_map24(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ DependencyGraphProof

                          ↳ QDP

                            ↳ Narrowing

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map24(y0, y1, x0, Zero, Succ(y4), y5) → new_map24(y0, Succ(x0), x0, Succ(x0), Succ(x0), y5)
new_map24(y0, y1, x0, Succ(x1), Succ(y4), y5) → new_map24(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ DependencyGraphProof

                          ↳ QDP

                            ↳ Narrowing

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ QDP

                                                    ↳ Instantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map24(y0, y1, x0, Succ(x1), Succ(y4), y5) → new_map24(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_map24(y0, y1, x0, Succ(x1), Succ(y4), y5) → new_map24(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5) we obtained the following new rules:

new_map24(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z5) → new_map24(z0, Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), z2, Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), z5)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ DependencyGraphProof

                          ↳ QDP

                            ↳ Narrowing

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ QDP

                                                    ↳ Instantiation

                                                      ↳ QDP

                                                        ↳ MNOCProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map24(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z5) → new_map24(z0, Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), z2, Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), z5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We use the modular non-overlap check [17] to decrease Q to the empty set.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ DependencyGraphProof

                          ↳ QDP

                            ↳ Narrowing

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Rewriting

                                              ↳ QDP

                                                ↳ DependencyGraphProof

                                                  ↳ QDP

                                                    ↳ Instantiation

                                                      ↳ QDP

                                                        ↳ MNOCProof

                                                          ↳ QDP

                                                            ↳ NonTerminationProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map24(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z5) → new_map24(z0, Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), z2, Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), z5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

new_map24(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z5) → new_map24(z0, Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), z2, Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), z5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

s = new_map24(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z5) evaluates to t =new_map24(z0, Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), z2, Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), z5)

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:

Matcher: [y_2 / new_primPlusNat0(z2, Succ(y_1)), y_1 / new_primPlusNat0(z2, Succ(y_1)), y_0 / new_primPlusNat0(z2, Succ(y_1))]
Semiunifier: [ ]

Rewriting sequence

The DP semiunifies directly so there is only one rewrite step from new_map24(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z5) to new_map24(z0, Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), z2, Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), Succ(Succ(new_primPlusNat0(z2, Succ(y_1)))), z5).

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map28(wy401, wy402, wy403, ba) → new_map27(wy401, wy403, wy402, ba)
new_map29(wy306, Succ(wy3070), Zero, wy309, bc) → new_map26(wy306, wy3070, wy309, Succ(wy3070), Succ(wy306), bc)
new_map26(wy401, wy402, wy403, Succ(wy4040), Succ(wy4050), ba) → new_map26(wy401, wy402, wy403, wy4040, wy4050, ba)
new_map29(wy306, Zero, Zero, wy309, bc) → new_map29(wy306, Zero, Succ(wy309), wy309, bc)
new_map26(wy401, wy402, wy403, Zero, Succ(wy4050), ba) → new_map27(wy401, wy403, wy402, ba)
new_map26(wy401, wy402, wy403, Zero, Zero, ba) → new_map28(wy401, wy402, wy403, ba)
new_map27(wy237, wy2390, wy240, bb) → new_map29(wy237, Succ(wy240), Succ(wy2390), wy2390, bb)
new_map29(wy306, Succ(wy3070), Succ(wy3080), wy309, bc) → new_map29(wy306, wy3070, wy3080, wy309, bc)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ QDPOrderProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map28(wy401, wy402, wy403, ba) → new_map27(wy401, wy403, wy402, ba)
new_map29(wy306, Succ(wy3070), Zero, wy309, bc) → new_map26(wy306, wy3070, wy309, Succ(wy3070), Succ(wy306), bc)
new_map26(wy401, wy402, wy403, Succ(wy4040), Succ(wy4050), ba) → new_map26(wy401, wy402, wy403, wy4040, wy4050, ba)
new_map26(wy401, wy402, wy403, Zero, Succ(wy4050), ba) → new_map27(wy401, wy403, wy402, ba)
new_map26(wy401, wy402, wy403, Zero, Zero, ba) → new_map28(wy401, wy402, wy403, ba)
new_map27(wy237, wy2390, wy240, bb) → new_map29(wy237, Succ(wy240), Succ(wy2390), wy2390, bb)
new_map29(wy306, Succ(wy3070), Succ(wy3080), wy309, bc) → new_map29(wy306, wy3070, wy3080, wy309, bc)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_map29(wy306, Succ(wy3070), Succ(wy3080), wy309, bc) → new_map29(wy306, wy3070, wy3080, wy309, bc)

The remaining pairs can at least be oriented weakly.

new_map28(wy401, wy402, wy403, ba) → new_map27(wy401, wy403, wy402, ba)
new_map29(wy306, Succ(wy3070), Zero, wy309, bc) → new_map26(wy306, wy3070, wy309, Succ(wy3070), Succ(wy306), bc)
new_map26(wy401, wy402, wy403, Succ(wy4040), Succ(wy4050), ba) → new_map26(wy401, wy402, wy403, wy4040, wy4050, ba)
new_map26(wy401, wy402, wy403, Zero, Succ(wy4050), ba) → new_map27(wy401, wy403, wy402, ba)
new_map26(wy401, wy402, wy403, Zero, Zero, ba) → new_map28(wy401, wy402, wy403, ba)
new_map27(wy237, wy2390, wy240, bb) → new_map29(wy237, Succ(wy240), Succ(wy2390), wy2390, bb)

Used ordering: Polynomial interpretation [25]:

POL(Succ(x₁)) = 1 + x₁
POL(Zero) = 0
POL(new_map26(x₁, x₂, x₃, x₄, x₅, x₆)) = 1 + x₂
POL(new_map27(x₁, x₂, x₃, x₄)) = 1 + x₃
POL(new_map28(x₁, x₂, x₃, x₄)) = 1 + x₂
POL(new_map29(x₁, x₂, x₃, x₄, x₅)) = x₂

The following usable rules [17] were oriented: none

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ DependencyGraphProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map29(wy306, Succ(wy3070), Zero, wy309, bc) → new_map26(wy306, wy3070, wy309, Succ(wy3070), Succ(wy306), bc)
new_map28(wy401, wy402, wy403, ba) → new_map27(wy401, wy403, wy402, ba)
new_map26(wy401, wy402, wy403, Succ(wy4040), Succ(wy4050), ba) → new_map26(wy401, wy402, wy403, wy4040, wy4050, ba)
new_map26(wy401, wy402, wy403, Zero, Succ(wy4050), ba) → new_map27(wy401, wy403, wy402, ba)
new_map26(wy401, wy402, wy403, Zero, Zero, ba) → new_map28(wy401, wy402, wy403, ba)
new_map27(wy237, wy2390, wy240, bb) → new_map29(wy237, Succ(wy240), Succ(wy2390), wy2390, bb)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 5 less nodes.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ QDPSizeChangeProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map26(wy401, wy402, wy403, Succ(wy4040), Succ(wy4050), ba) → new_map26(wy401, wy402, wy403, wy4040, wy4050, ba)

From the DPs we obtained the following set of size-change graphs:

new_map26(wy401, wy402, wy403, Succ(wy4040), Succ(wy4050), ba) → new_map26(wy401, wy402, wy403, wy4040, wy4050, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 > 4, 5 > 5, 6 >= 6

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPSizeChangeProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map30(wy60, wy61, Succ(wy620), Succ(wy630), ba) → new_map30(wy60, wy61, wy620, wy630, ba)

From the DPs we obtained the following set of size-change graphs:

new_map30(wy60, wy61, Succ(wy620), Succ(wy630), ba) → new_map30(wy60, wy61, wy620, wy630, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3, 4 > 4, 5 >= 5

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map31(wy271, Succ(wy2720), Zero, wy274, ba) → new_map32(wy271, wy274, wy2720, ba)
new_map32(wy187, wy1890, wy190, bb) → new_map31(wy187, Succ(wy190), Succ(wy1890), wy1890, bb)
new_map31(wy271, Succ(wy2720), Succ(wy2730), wy274, ba) → new_map31(wy271, wy2720, wy2730, wy274, ba)
new_map31(Succ(wy2710), Zero, Zero, wy274, ba) → new_map31(Succ(wy2710), Zero, Succ(wy274), wy274, ba)
new_map31(Zero, Zero, Zero, wy274, ba) → new_map31(Zero, Zero, Succ(wy274), wy274, ba)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 2 less nodes.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ QDPOrderProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map31(wy271, Succ(wy2720), Zero, wy274, ba) → new_map32(wy271, wy274, wy2720, ba)
new_map32(wy187, wy1890, wy190, bb) → new_map31(wy187, Succ(wy190), Succ(wy1890), wy1890, bb)
new_map31(wy271, Succ(wy2720), Succ(wy2730), wy274, ba) → new_map31(wy271, wy2720, wy2730, wy274, ba)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_map31(wy271, Succ(wy2720), Succ(wy2730), wy274, ba) → new_map31(wy271, wy2720, wy2730, wy274, ba)

The remaining pairs can at least be oriented weakly.

new_map31(wy271, Succ(wy2720), Zero, wy274, ba) → new_map32(wy271, wy274, wy2720, ba)
new_map32(wy187, wy1890, wy190, bb) → new_map31(wy187, Succ(wy190), Succ(wy1890), wy1890, bb)

Used ordering: Polynomial interpretation [25]:

POL(Succ(x₁)) = 1 + x₁
POL(Zero) = 0
POL(new_map31(x₁, x₂, x₃, x₄, x₅)) = x₂
POL(new_map32(x₁, x₂, x₃, x₄)) = 1 + x₃

The following usable rules [17] were oriented: none

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ DependencyGraphProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map31(wy271, Succ(wy2720), Zero, wy274, ba) → new_map32(wy271, wy274, wy2720, ba)
new_map32(wy187, wy1890, wy190, bb) → new_map31(wy187, Succ(wy190), Succ(wy1890), wy1890, bb)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 0 SCCs with 2 less nodes.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPSizeChangeProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map33(wy187, Succ(wy1880), Succ(wy1890), wy190, ba) → new_map33(wy187, wy1880, wy1890, wy190, ba)

From the DPs we obtained the following set of size-change graphs:

new_map33(wy187, Succ(wy1880), Succ(wy1890), wy190, ba) → new_map33(wy187, wy1880, wy1890, wy190, ba)
The graph contains the following edges 1 >= 1, 2 > 2, 3 > 3, 4 >= 4, 5 >= 5

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map34(Succ(wy2670), Zero, wy269, ba) → new_map35(wy269, wy2670, ba)
new_map34(Zero, Zero, wy269, ba) → new_map34(Zero, Succ(wy269), wy269, ba)
new_map35(wy1930, wy194, bb) → new_map34(Succ(wy194), Succ(wy1930), wy1930, bb)
new_map34(Succ(wy2670), Succ(wy2680), wy269, ba) → new_map34(wy2670, wy2680, wy269, ba)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ QDPOrderProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map34(Succ(wy2670), Zero, wy269, ba) → new_map35(wy269, wy2670, ba)
new_map35(wy1930, wy194, bb) → new_map34(Succ(wy194), Succ(wy1930), wy1930, bb)
new_map34(Succ(wy2670), Succ(wy2680), wy269, ba) → new_map34(wy2670, wy2680, wy269, ba)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_map34(Succ(wy2670), Succ(wy2680), wy269, ba) → new_map34(wy2670, wy2680, wy269, ba)

The remaining pairs can at least be oriented weakly.

new_map34(Succ(wy2670), Zero, wy269, ba) → new_map35(wy269, wy2670, ba)
new_map35(wy1930, wy194, bb) → new_map34(Succ(wy194), Succ(wy1930), wy1930, bb)

Used ordering: Polynomial interpretation [25]:

POL(Succ(x₁)) = 1 + x₁
POL(Zero) = 0
POL(new_map34(x₁, x₂, x₃, x₄)) = x₁
POL(new_map35(x₁, x₂, x₃)) = 1 + x₂

The following usable rules [17] were oriented: none

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ DependencyGraphProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ DependencyGraphProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map34(Succ(wy2670), Zero, wy269, ba) → new_map35(wy269, wy2670, ba)
new_map35(wy1930, wy194, bb) → new_map34(Succ(wy194), Succ(wy1930), wy1930, bb)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 0 SCCs with 2 less nodes.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPSizeChangeProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map36(Succ(wy1920), Succ(wy1930), wy194, ba) → new_map36(wy1920, wy1930, wy194, ba)

From the DPs we obtained the following set of size-change graphs:

new_map36(Succ(wy1920), Succ(wy1930), wy194, ba) → new_map36(wy1920, wy1930, wy194, ba)
The graph contains the following edges 1 > 1, 2 > 2, 3 >= 3, 4 >= 4

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPSizeChangeProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map37(wy134, wy135, wy136, Succ(wy1370), Succ(wy1380), ba) → new_map37(wy134, wy135, wy136, wy1370, wy1380, ba)

From the DPs we obtained the following set of size-change graphs:

new_map37(wy134, wy135, wy136, Succ(wy1370), Succ(wy1380), ba) → new_map37(wy134, wy135, wy136, wy1370, wy1380, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 > 4, 5 > 5, 6 >= 6

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map38(wy246, wy247, wy248, Succ(wy2490), Succ(wy2500), ba) → new_map38(wy246, wy247, wy248, wy2490, wy2500, ba)
new_map39(wy107, wy180, wy181, Zero, bb) → new_map38(wy107, wy180, wy181, Zero, Succ(wy107), bb)
new_map40(wy246, wy247, wy248, ba) → new_map39(wy246, new_primPlusNat0(Zero, wy248), new_primPlusNat0(Zero, wy248), new_primPlusNat0(Zero, wy248), ba)
new_map39(wy107, wy180, wy181, Succ(wy1820), bb) → new_map38(wy107, wy180, wy181, Succ(wy1820), Succ(wy107), bb)
new_map38(wy246, wy247, wy248, Zero, Zero, ba) → new_map40(wy246, wy247, wy248, ba)
new_map38(wy246, wy247, wy248, Zero, Succ(wy2500), ba) → new_map39(wy246, new_primPlusNat0(Zero, wy248), new_primPlusNat0(Zero, wy248), new_primPlusNat0(Zero, wy248), ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map38(wy246, wy247, wy248, Succ(wy2490), Succ(wy2500), ba) → new_map38(wy246, wy247, wy248, wy2490, wy2500, ba)
new_map39(wy107, wy180, wy181, Zero, bb) → new_map38(wy107, wy180, wy181, Zero, Succ(wy107), bb)
new_map40(wy246, wy247, wy248, ba) → new_map39(wy246, new_primPlusNat0(Zero, wy248), new_primPlusNat0(Zero, wy248), new_primPlusNat0(Zero, wy248), ba)
new_map39(wy107, wy180, wy181, Succ(wy1820), bb) → new_map38(wy107, wy180, wy181, Succ(wy1820), Succ(wy107), bb)
new_map38(wy246, wy247, wy248, Zero, Zero, ba) → new_map40(wy246, wy247, wy248, ba)
new_map38(wy246, wy247, wy248, Zero, Succ(wy2500), ba) → new_map39(wy246, new_primPlusNat0(Zero, wy248), new_primPlusNat0(Zero, wy248), new_primPlusNat0(Zero, wy248), ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule new_map40(wy246, wy247, wy248, ba) → new_map39(wy246, new_primPlusNat0(Zero, wy248), new_primPlusNat0(Zero, wy248), new_primPlusNat0(Zero, wy248), ba) at position [3] we obtained the following new rules:

new_map40(y0, y1, Zero, y3) → new_map39(y0, new_primPlusNat0(Zero, Zero), new_primPlusNat0(Zero, Zero), Zero, y3)
new_map40(y0, y1, Succ(x0), y3) → new_map39(y0, new_primPlusNat0(Zero, Succ(x0)), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y3)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map38(wy246, wy247, wy248, Succ(wy2490), Succ(wy2500), ba) → new_map38(wy246, wy247, wy248, wy2490, wy2500, ba)
new_map39(wy107, wy180, wy181, Zero, bb) → new_map38(wy107, wy180, wy181, Zero, Succ(wy107), bb)
new_map39(wy107, wy180, wy181, Succ(wy1820), bb) → new_map38(wy107, wy180, wy181, Succ(wy1820), Succ(wy107), bb)
new_map40(y0, y1, Zero, y3) → new_map39(y0, new_primPlusNat0(Zero, Zero), new_primPlusNat0(Zero, Zero), Zero, y3)
new_map40(y0, y1, Succ(x0), y3) → new_map39(y0, new_primPlusNat0(Zero, Succ(x0)), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y3)
new_map38(wy246, wy247, wy248, Zero, Zero, ba) → new_map40(wy246, wy247, wy248, ba)
new_map38(wy246, wy247, wy248, Zero, Succ(wy2500), ba) → new_map39(wy246, new_primPlusNat0(Zero, wy248), new_primPlusNat0(Zero, wy248), new_primPlusNat0(Zero, wy248), ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map40(y0, y1, Zero, y3) → new_map39(y0, new_primPlusNat0(Zero, Zero), new_primPlusNat0(Zero, Zero), Zero, y3) at position [1] we obtained the following new rules:

new_map40(y0, y1, Zero, y3) → new_map39(y0, Zero, new_primPlusNat0(Zero, Zero), Zero, y3)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map38(wy246, wy247, wy248, Succ(wy2490), Succ(wy2500), ba) → new_map38(wy246, wy247, wy248, wy2490, wy2500, ba)
new_map39(wy107, wy180, wy181, Zero, bb) → new_map38(wy107, wy180, wy181, Zero, Succ(wy107), bb)
new_map40(y0, y1, Zero, y3) → new_map39(y0, Zero, new_primPlusNat0(Zero, Zero), Zero, y3)
new_map39(wy107, wy180, wy181, Succ(wy1820), bb) → new_map38(wy107, wy180, wy181, Succ(wy1820), Succ(wy107), bb)
new_map38(wy246, wy247, wy248, Zero, Zero, ba) → new_map40(wy246, wy247, wy248, ba)
new_map40(y0, y1, Succ(x0), y3) → new_map39(y0, new_primPlusNat0(Zero, Succ(x0)), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y3)
new_map38(wy246, wy247, wy248, Zero, Succ(wy2500), ba) → new_map39(wy246, new_primPlusNat0(Zero, wy248), new_primPlusNat0(Zero, wy248), new_primPlusNat0(Zero, wy248), ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map40(y0, y1, Succ(x0), y3) → new_map39(y0, new_primPlusNat0(Zero, Succ(x0)), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y3) at position [1] we obtained the following new rules:

new_map40(y0, y1, Succ(x0), y3) → new_map39(y0, Succ(x0), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y3)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map40(y0, y1, Succ(x0), y3) → new_map39(y0, Succ(x0), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y3)
new_map38(wy246, wy247, wy248, Succ(wy2490), Succ(wy2500), ba) → new_map38(wy246, wy247, wy248, wy2490, wy2500, ba)
new_map39(wy107, wy180, wy181, Zero, bb) → new_map38(wy107, wy180, wy181, Zero, Succ(wy107), bb)
new_map40(y0, y1, Zero, y3) → new_map39(y0, Zero, new_primPlusNat0(Zero, Zero), Zero, y3)
new_map39(wy107, wy180, wy181, Succ(wy1820), bb) → new_map38(wy107, wy180, wy181, Succ(wy1820), Succ(wy107), bb)
new_map38(wy246, wy247, wy248, Zero, Zero, ba) → new_map40(wy246, wy247, wy248, ba)
new_map38(wy246, wy247, wy248, Zero, Succ(wy2500), ba) → new_map39(wy246, new_primPlusNat0(Zero, wy248), new_primPlusNat0(Zero, wy248), new_primPlusNat0(Zero, wy248), ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map40(y0, y1, Zero, y3) → new_map39(y0, Zero, new_primPlusNat0(Zero, Zero), Zero, y3) at position [2] we obtained the following new rules:

new_map40(y0, y1, Zero, y3) → new_map39(y0, Zero, Zero, Zero, y3)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map40(y0, y1, Succ(x0), y3) → new_map39(y0, Succ(x0), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y3)
new_map38(wy246, wy247, wy248, Succ(wy2490), Succ(wy2500), ba) → new_map38(wy246, wy247, wy248, wy2490, wy2500, ba)
new_map39(wy107, wy180, wy181, Zero, bb) → new_map38(wy107, wy180, wy181, Zero, Succ(wy107), bb)
new_map39(wy107, wy180, wy181, Succ(wy1820), bb) → new_map38(wy107, wy180, wy181, Succ(wy1820), Succ(wy107), bb)
new_map40(y0, y1, Zero, y3) → new_map39(y0, Zero, Zero, Zero, y3)
new_map38(wy246, wy247, wy248, Zero, Zero, ba) → new_map40(wy246, wy247, wy248, ba)
new_map38(wy246, wy247, wy248, Zero, Succ(wy2500), ba) → new_map39(wy246, new_primPlusNat0(Zero, wy248), new_primPlusNat0(Zero, wy248), new_primPlusNat0(Zero, wy248), ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map40(y0, y1, Succ(x0), y3) → new_map39(y0, Succ(x0), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y3) at position [2] we obtained the following new rules:

new_map40(y0, y1, Succ(x0), y3) → new_map39(y0, Succ(x0), Succ(x0), Succ(x0), y3)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map38(wy246, wy247, wy248, Succ(wy2490), Succ(wy2500), ba) → new_map38(wy246, wy247, wy248, wy2490, wy2500, ba)
new_map39(wy107, wy180, wy181, Zero, bb) → new_map38(wy107, wy180, wy181, Zero, Succ(wy107), bb)
new_map40(y0, y1, Succ(x0), y3) → new_map39(y0, Succ(x0), Succ(x0), Succ(x0), y3)
new_map39(wy107, wy180, wy181, Succ(wy1820), bb) → new_map38(wy107, wy180, wy181, Succ(wy1820), Succ(wy107), bb)
new_map40(y0, y1, Zero, y3) → new_map39(y0, Zero, Zero, Zero, y3)
new_map38(wy246, wy247, wy248, Zero, Zero, ba) → new_map40(wy246, wy247, wy248, ba)
new_map38(wy246, wy247, wy248, Zero, Succ(wy2500), ba) → new_map39(wy246, new_primPlusNat0(Zero, wy248), new_primPlusNat0(Zero, wy248), new_primPlusNat0(Zero, wy248), ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule new_map38(wy246, wy247, wy248, Zero, Succ(wy2500), ba) → new_map39(wy246, new_primPlusNat0(Zero, wy248), new_primPlusNat0(Zero, wy248), new_primPlusNat0(Zero, wy248), ba) at position [3] we obtained the following new rules:

new_map38(y0, y1, Succ(x0), Zero, Succ(y3), y4) → new_map39(y0, new_primPlusNat0(Zero, Succ(x0)), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y4)
new_map38(y0, y1, Zero, Zero, Succ(y3), y4) → new_map39(y0, new_primPlusNat0(Zero, Zero), new_primPlusNat0(Zero, Zero), Zero, y4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map38(wy246, wy247, wy248, Succ(wy2490), Succ(wy2500), ba) → new_map38(wy246, wy247, wy248, wy2490, wy2500, ba)
new_map39(wy107, wy180, wy181, Zero, bb) → new_map38(wy107, wy180, wy181, Zero, Succ(wy107), bb)
new_map40(y0, y1, Succ(x0), y3) → new_map39(y0, Succ(x0), Succ(x0), Succ(x0), y3)
new_map39(wy107, wy180, wy181, Succ(wy1820), bb) → new_map38(wy107, wy180, wy181, Succ(wy1820), Succ(wy107), bb)
new_map38(y0, y1, Succ(x0), Zero, Succ(y3), y4) → new_map39(y0, new_primPlusNat0(Zero, Succ(x0)), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y4)
new_map40(y0, y1, Zero, y3) → new_map39(y0, Zero, Zero, Zero, y3)
new_map38(y0, y1, Zero, Zero, Succ(y3), y4) → new_map39(y0, new_primPlusNat0(Zero, Zero), new_primPlusNat0(Zero, Zero), Zero, y4)
new_map38(wy246, wy247, wy248, Zero, Zero, ba) → new_map40(wy246, wy247, wy248, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map38(y0, y1, Succ(x0), Zero, Succ(y3), y4) → new_map39(y0, new_primPlusNat0(Zero, Succ(x0)), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y4) at position [1] we obtained the following new rules:

new_map38(y0, y1, Succ(x0), Zero, Succ(y3), y4) → new_map39(y0, Succ(x0), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map38(wy246, wy247, wy248, Succ(wy2490), Succ(wy2500), ba) → new_map38(wy246, wy247, wy248, wy2490, wy2500, ba)
new_map39(wy107, wy180, wy181, Zero, bb) → new_map38(wy107, wy180, wy181, Zero, Succ(wy107), bb)
new_map40(y0, y1, Succ(x0), y3) → new_map39(y0, Succ(x0), Succ(x0), Succ(x0), y3)
new_map39(wy107, wy180, wy181, Succ(wy1820), bb) → new_map38(wy107, wy180, wy181, Succ(wy1820), Succ(wy107), bb)
new_map38(y0, y1, Succ(x0), Zero, Succ(y3), y4) → new_map39(y0, Succ(x0), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y4)
new_map40(y0, y1, Zero, y3) → new_map39(y0, Zero, Zero, Zero, y3)
new_map38(wy246, wy247, wy248, Zero, Zero, ba) → new_map40(wy246, wy247, wy248, ba)
new_map38(y0, y1, Zero, Zero, Succ(y3), y4) → new_map39(y0, new_primPlusNat0(Zero, Zero), new_primPlusNat0(Zero, Zero), Zero, y4)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map38(y0, y1, Zero, Zero, Succ(y3), y4) → new_map39(y0, new_primPlusNat0(Zero, Zero), new_primPlusNat0(Zero, Zero), Zero, y4) at position [1] we obtained the following new rules:

new_map38(y0, y1, Zero, Zero, Succ(y3), y4) → new_map39(y0, Zero, new_primPlusNat0(Zero, Zero), Zero, y4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map38(wy246, wy247, wy248, Succ(wy2490), Succ(wy2500), ba) → new_map38(wy246, wy247, wy248, wy2490, wy2500, ba)
new_map38(y0, y1, Zero, Zero, Succ(y3), y4) → new_map39(y0, Zero, new_primPlusNat0(Zero, Zero), Zero, y4)
new_map39(wy107, wy180, wy181, Zero, bb) → new_map38(wy107, wy180, wy181, Zero, Succ(wy107), bb)
new_map40(y0, y1, Succ(x0), y3) → new_map39(y0, Succ(x0), Succ(x0), Succ(x0), y3)
new_map39(wy107, wy180, wy181, Succ(wy1820), bb) → new_map38(wy107, wy180, wy181, Succ(wy1820), Succ(wy107), bb)
new_map40(y0, y1, Zero, y3) → new_map39(y0, Zero, Zero, Zero, y3)
new_map38(y0, y1, Succ(x0), Zero, Succ(y3), y4) → new_map39(y0, Succ(x0), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y4)
new_map38(wy246, wy247, wy248, Zero, Zero, ba) → new_map40(wy246, wy247, wy248, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map38(y0, y1, Succ(x0), Zero, Succ(y3), y4) → new_map39(y0, Succ(x0), new_primPlusNat0(Zero, Succ(x0)), Succ(x0), y4) at position [2] we obtained the following new rules:

new_map38(y0, y1, Succ(x0), Zero, Succ(y3), y4) → new_map39(y0, Succ(x0), Succ(x0), Succ(x0), y4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ UsableRulesProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map38(wy246, wy247, wy248, Succ(wy2490), Succ(wy2500), ba) → new_map38(wy246, wy247, wy248, wy2490, wy2500, ba)
new_map39(wy107, wy180, wy181, Zero, bb) → new_map38(wy107, wy180, wy181, Zero, Succ(wy107), bb)
new_map38(y0, y1, Zero, Zero, Succ(y3), y4) → new_map39(y0, Zero, new_primPlusNat0(Zero, Zero), Zero, y4)
new_map38(y0, y1, Succ(x0), Zero, Succ(y3), y4) → new_map39(y0, Succ(x0), Succ(x0), Succ(x0), y4)
new_map40(y0, y1, Succ(x0), y3) → new_map39(y0, Succ(x0), Succ(x0), Succ(x0), y3)
new_map39(wy107, wy180, wy181, Succ(wy1820), bb) → new_map38(wy107, wy180, wy181, Succ(wy1820), Succ(wy107), bb)
new_map40(y0, y1, Zero, y3) → new_map39(y0, Zero, Zero, Zero, y3)
new_map38(wy246, wy247, wy248, Zero, Zero, ba) → new_map40(wy246, wy247, wy248, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ UsableRulesProof

                                                              ↳ QDP

                                                                ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map38(wy246, wy247, wy248, Succ(wy2490), Succ(wy2500), ba) → new_map38(wy246, wy247, wy248, wy2490, wy2500, ba)
new_map38(y0, y1, Zero, Zero, Succ(y3), y4) → new_map39(y0, Zero, new_primPlusNat0(Zero, Zero), Zero, y4)
new_map39(wy107, wy180, wy181, Zero, bb) → new_map38(wy107, wy180, wy181, Zero, Succ(wy107), bb)
new_map38(y0, y1, Succ(x0), Zero, Succ(y3), y4) → new_map39(y0, Succ(x0), Succ(x0), Succ(x0), y4)
new_map40(y0, y1, Succ(x0), y3) → new_map39(y0, Succ(x0), Succ(x0), Succ(x0), y3)
new_map39(wy107, wy180, wy181, Succ(wy1820), bb) → new_map38(wy107, wy180, wy181, Succ(wy1820), Succ(wy107), bb)
new_map40(y0, y1, Zero, y3) → new_map39(y0, Zero, Zero, Zero, y3)
new_map38(wy246, wy247, wy248, Zero, Zero, ba) → new_map40(wy246, wy247, wy248, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map38(y0, y1, Zero, Zero, Succ(y3), y4) → new_map39(y0, Zero, new_primPlusNat0(Zero, Zero), Zero, y4) at position [2] we obtained the following new rules:

new_map38(y0, y1, Zero, Zero, Succ(y3), y4) → new_map39(y0, Zero, Zero, Zero, y4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ UsableRulesProof

                                                              ↳ QDP

                                                                ↳ Rewriting

                                                                  ↳ QDP

                                                                    ↳ UsableRulesProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map38(wy246, wy247, wy248, Succ(wy2490), Succ(wy2500), ba) → new_map38(wy246, wy247, wy248, wy2490, wy2500, ba)
new_map39(wy107, wy180, wy181, Zero, bb) → new_map38(wy107, wy180, wy181, Zero, Succ(wy107), bb)
new_map38(y0, y1, Succ(x0), Zero, Succ(y3), y4) → new_map39(y0, Succ(x0), Succ(x0), Succ(x0), y4)
new_map40(y0, y1, Succ(x0), y3) → new_map39(y0, Succ(x0), Succ(x0), Succ(x0), y3)
new_map38(y0, y1, Zero, Zero, Succ(y3), y4) → new_map39(y0, Zero, Zero, Zero, y4)
new_map39(wy107, wy180, wy181, Succ(wy1820), bb) → new_map38(wy107, wy180, wy181, Succ(wy1820), Succ(wy107), bb)
new_map40(y0, y1, Zero, y3) → new_map39(y0, Zero, Zero, Zero, y3)
new_map38(wy246, wy247, wy248, Zero, Zero, ba) → new_map40(wy246, wy247, wy248, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ UsableRulesProof

                                                              ↳ QDP

                                                                ↳ Rewriting

                                                                  ↳ QDP

                                                                    ↳ UsableRulesProof

                                                                      ↳ QDP

                                                                        ↳ QReductionProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map38(wy246, wy247, wy248, Succ(wy2490), Succ(wy2500), ba) → new_map38(wy246, wy247, wy248, wy2490, wy2500, ba)
new_map39(wy107, wy180, wy181, Zero, bb) → new_map38(wy107, wy180, wy181, Zero, Succ(wy107), bb)
new_map38(y0, y1, Succ(x0), Zero, Succ(y3), y4) → new_map39(y0, Succ(x0), Succ(x0), Succ(x0), y4)
new_map40(y0, y1, Succ(x0), y3) → new_map39(y0, Succ(x0), Succ(x0), Succ(x0), y3)
new_map38(y0, y1, Zero, Zero, Succ(y3), y4) → new_map39(y0, Zero, Zero, Zero, y4)
new_map39(wy107, wy180, wy181, Succ(wy1820), bb) → new_map38(wy107, wy180, wy181, Succ(wy1820), Succ(wy107), bb)
new_map40(y0, y1, Zero, y3) → new_map39(y0, Zero, Zero, Zero, y3)
new_map38(wy246, wy247, wy248, Zero, Zero, ba) → new_map40(wy246, wy247, wy248, ba)

R is empty.
The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ UsableRulesProof

                                                              ↳ QDP

                                                                ↳ Rewriting

                                                                  ↳ QDP

                                                                    ↳ UsableRulesProof

                                                                      ↳ QDP

                                                                        ↳ QReductionProof

                                                                          ↳ QDP

                                                                            ↳ Instantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map38(wy246, wy247, wy248, Succ(wy2490), Succ(wy2500), ba) → new_map38(wy246, wy247, wy248, wy2490, wy2500, ba)
new_map39(wy107, wy180, wy181, Zero, bb) → new_map38(wy107, wy180, wy181, Zero, Succ(wy107), bb)
new_map38(y0, y1, Succ(x0), Zero, Succ(y3), y4) → new_map39(y0, Succ(x0), Succ(x0), Succ(x0), y4)
new_map40(y0, y1, Succ(x0), y3) → new_map39(y0, Succ(x0), Succ(x0), Succ(x0), y3)
new_map38(y0, y1, Zero, Zero, Succ(y3), y4) → new_map39(y0, Zero, Zero, Zero, y4)
new_map39(wy107, wy180, wy181, Succ(wy1820), bb) → new_map38(wy107, wy180, wy181, Succ(wy1820), Succ(wy107), bb)
new_map40(y0, y1, Zero, y3) → new_map39(y0, Zero, Zero, Zero, y3)
new_map38(wy246, wy247, wy248, Zero, Zero, ba) → new_map40(wy246, wy247, wy248, ba)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_map39(wy107, wy180, wy181, Zero, bb) → new_map38(wy107, wy180, wy181, Zero, Succ(wy107), bb) we obtained the following new rules:

new_map39(z0, Zero, Zero, Zero, z3) → new_map38(z0, Zero, Zero, Zero, Succ(z0), z3)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ UsableRulesProof

                                                              ↳ QDP

                                                                ↳ Rewriting

                                                                  ↳ QDP

                                                                    ↳ UsableRulesProof

                                                                      ↳ QDP

                                                                        ↳ QReductionProof

                                                                          ↳ QDP

                                                                            ↳ Instantiation

                                                                              ↳ QDP

                                                                                ↳ DependencyGraphProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map38(wy246, wy247, wy248, Succ(wy2490), Succ(wy2500), ba) → new_map38(wy246, wy247, wy248, wy2490, wy2500, ba)
new_map39(z0, Zero, Zero, Zero, z3) → new_map38(z0, Zero, Zero, Zero, Succ(z0), z3)
new_map38(y0, y1, Succ(x0), Zero, Succ(y3), y4) → new_map39(y0, Succ(x0), Succ(x0), Succ(x0), y4)
new_map40(y0, y1, Succ(x0), y3) → new_map39(y0, Succ(x0), Succ(x0), Succ(x0), y3)
new_map38(y0, y1, Zero, Zero, Succ(y3), y4) → new_map39(y0, Zero, Zero, Zero, y4)
new_map39(wy107, wy180, wy181, Succ(wy1820), bb) → new_map38(wy107, wy180, wy181, Succ(wy1820), Succ(wy107), bb)
new_map40(y0, y1, Zero, y3) → new_map39(y0, Zero, Zero, Zero, y3)
new_map38(wy246, wy247, wy248, Zero, Zero, ba) → new_map40(wy246, wy247, wy248, ba)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 2 SCCs with 1 less node.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ UsableRulesProof

                                                              ↳ QDP

                                                                ↳ Rewriting

                                                                  ↳ QDP

                                                                    ↳ UsableRulesProof

                                                                      ↳ QDP

                                                                        ↳ QReductionProof

                                                                          ↳ QDP

                                                                            ↳ Instantiation

                                                                              ↳ QDP

                                                                                ↳ DependencyGraphProof

                                                                                  ↳ AND

                                                                                    ↳ QDP

                                                                                      ↳ Instantiation

                                                                                    ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map39(z0, Zero, Zero, Zero, z3) → new_map38(z0, Zero, Zero, Zero, Succ(z0), z3)
new_map38(y0, y1, Zero, Zero, Succ(y3), y4) → new_map39(y0, Zero, Zero, Zero, y4)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_map38(y0, y1, Zero, Zero, Succ(y3), y4) → new_map39(y0, Zero, Zero, Zero, y4) we obtained the following new rules:

new_map38(z0, Zero, Zero, Zero, Succ(z0), z1) → new_map39(z0, Zero, Zero, Zero, z1)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ UsableRulesProof

                                                              ↳ QDP

                                                                ↳ Rewriting

                                                                  ↳ QDP

                                                                    ↳ UsableRulesProof

                                                                      ↳ QDP

                                                                        ↳ QReductionProof

                                                                          ↳ QDP

                                                                            ↳ Instantiation

                                                                              ↳ QDP

                                                                                ↳ DependencyGraphProof

                                                                                  ↳ AND

                                                                                    ↳ QDP

                                                                                      ↳ Instantiation

                                                                                        ↳ QDP

                                                                                          ↳ NonTerminationProof

                                                                                    ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map39(z0, Zero, Zero, Zero, z3) → new_map38(z0, Zero, Zero, Zero, Succ(z0), z3)
new_map38(z0, Zero, Zero, Zero, Succ(z0), z1) → new_map39(z0, Zero, Zero, Zero, z1)

The TRS R consists of the following rules:none

s = new_map38(z0', Zero, Zero, Zero, Succ(z0'), z1) evaluates to t =new_map38(z0', Zero, Zero, Zero, Succ(z0'), z1)

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:

Semiunifier: [ ]
Matcher: [ ]

Rewriting sequence

new_map38(z0', Zero, Zero, Zero, Succ(z0'), z1) → new_map39(z0', Zero, Zero, Zero, z1)
with rule new_map38(z0'', Zero, Zero, Zero, Succ(z0''), z1') → new_map39(z0'', Zero, Zero, Zero, z1') at position [] and matcher [z1' / z1, z0'' / z0']

new_map39(z0', Zero, Zero, Zero, z1) → new_map38(z0', Zero, Zero, Zero, Succ(z0'), z1)
with rule new_map39(z0, Zero, Zero, Zero, z3) → new_map38(z0, Zero, Zero, Zero, Succ(z0), z3)

Now applying the matcher to the start term leads to a term which is equal to the last term in the rewriting sequence

All these steps are and every following step will be a correct step w.r.t to Q.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ UsableRulesProof

                                                              ↳ QDP

                                                                ↳ Rewriting

                                                                  ↳ QDP

                                                                    ↳ UsableRulesProof

                                                                      ↳ QDP

                                                                        ↳ QReductionProof

                                                                          ↳ QDP

                                                                            ↳ Instantiation

                                                                              ↳ QDP

                                                                                ↳ DependencyGraphProof

                                                                                  ↳ AND

                                                                                    ↳ QDP

                                                                                    ↳ QDP

                                                                                      ↳ Instantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map38(wy246, wy247, wy248, Succ(wy2490), Succ(wy2500), ba) → new_map38(wy246, wy247, wy248, wy2490, wy2500, ba)
new_map38(y0, y1, Succ(x0), Zero, Succ(y3), y4) → new_map39(y0, Succ(x0), Succ(x0), Succ(x0), y4)
new_map40(y0, y1, Succ(x0), y3) → new_map39(y0, Succ(x0), Succ(x0), Succ(x0), y3)
new_map39(wy107, wy180, wy181, Succ(wy1820), bb) → new_map38(wy107, wy180, wy181, Succ(wy1820), Succ(wy107), bb)
new_map38(wy246, wy247, wy248, Zero, Zero, ba) → new_map40(wy246, wy247, wy248, ba)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_map39(wy107, wy180, wy181, Succ(wy1820), bb) → new_map38(wy107, wy180, wy181, Succ(wy1820), Succ(wy107), bb) we obtained the following new rules:

new_map39(z0, Succ(z2), Succ(z2), Succ(z2), z3) → new_map38(z0, Succ(z2), Succ(z2), Succ(z2), Succ(z0), z3)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ UsableRulesProof

                                                              ↳ QDP

                                                                ↳ Rewriting

                                                                  ↳ QDP

                                                                    ↳ UsableRulesProof

                                                                      ↳ QDP

                                                                        ↳ QReductionProof

                                                                          ↳ QDP

                                                                            ↳ Instantiation

                                                                              ↳ QDP

                                                                                ↳ DependencyGraphProof

                                                                                  ↳ AND

                                                                                    ↳ QDP

                                                                                    ↳ QDP

                                                                                      ↳ Instantiation

                                                                                        ↳ QDP

                                                                                          ↳ ForwardInstantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map38(wy246, wy247, wy248, Succ(wy2490), Succ(wy2500), ba) → new_map38(wy246, wy247, wy248, wy2490, wy2500, ba)
new_map38(y0, y1, Succ(x0), Zero, Succ(y3), y4) → new_map39(y0, Succ(x0), Succ(x0), Succ(x0), y4)
new_map40(y0, y1, Succ(x0), y3) → new_map39(y0, Succ(x0), Succ(x0), Succ(x0), y3)
new_map39(z0, Succ(z2), Succ(z2), Succ(z2), z3) → new_map38(z0, Succ(z2), Succ(z2), Succ(z2), Succ(z0), z3)
new_map38(wy246, wy247, wy248, Zero, Zero, ba) → new_map40(wy246, wy247, wy248, ba)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map38(wy246, wy247, wy248, Zero, Zero, ba) → new_map40(wy246, wy247, wy248, ba) we obtained the following new rules:

new_map38(x0, x1, Succ(y_2), Zero, Zero, x3) → new_map40(x0, x1, Succ(y_2), x3)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ UsableRulesProof

                                                              ↳ QDP

                                                                ↳ Rewriting

                                                                  ↳ QDP

                                                                    ↳ UsableRulesProof

                                                                      ↳ QDP

                                                                        ↳ QReductionProof

                                                                          ↳ QDP

                                                                            ↳ Instantiation

                                                                              ↳ QDP

                                                                                ↳ DependencyGraphProof

                                                                                  ↳ AND

                                                                                    ↳ QDP

                                                                                    ↳ QDP

                                                                                      ↳ Instantiation

                                                                                        ↳ QDP

                                                                                          ↳ ForwardInstantiation

                                                                                            ↳ QDP

                                                                                              ↳ ForwardInstantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map38(wy246, wy247, wy248, Succ(wy2490), Succ(wy2500), ba) → new_map38(wy246, wy247, wy248, wy2490, wy2500, ba)
new_map38(x0, x1, Succ(y_2), Zero, Zero, x3) → new_map40(x0, x1, Succ(y_2), x3)
new_map38(y0, y1, Succ(x0), Zero, Succ(y3), y4) → new_map39(y0, Succ(x0), Succ(x0), Succ(x0), y4)
new_map40(y0, y1, Succ(x0), y3) → new_map39(y0, Succ(x0), Succ(x0), Succ(x0), y3)
new_map39(z0, Succ(z2), Succ(z2), Succ(z2), z3) → new_map38(z0, Succ(z2), Succ(z2), Succ(z2), Succ(z0), z3)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map38(wy246, wy247, wy248, Succ(wy2490), Succ(wy2500), ba) → new_map38(wy246, wy247, wy248, wy2490, wy2500, ba) we obtained the following new rules:

new_map38(x0, x1, Succ(y_2), Succ(Zero), Succ(Zero), x5) → new_map38(x0, x1, Succ(y_2), Zero, Zero, x5)
new_map38(x0, x1, Succ(y_2), Succ(Zero), Succ(Succ(y_3)), x5) → new_map38(x0, x1, Succ(y_2), Zero, Succ(y_3), x5)
new_map38(x0, x1, x2, Succ(Succ(y_3)), Succ(Succ(y_4)), x5) → new_map38(x0, x1, x2, Succ(y_3), Succ(y_4), x5)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ UsableRulesProof

                                                              ↳ QDP

                                                                ↳ Rewriting

                                                                  ↳ QDP

                                                                    ↳ UsableRulesProof

                                                                      ↳ QDP

                                                                        ↳ QReductionProof

                                                                          ↳ QDP

                                                                            ↳ Instantiation

                                                                              ↳ QDP

                                                                                ↳ DependencyGraphProof

                                                                                  ↳ AND

                                                                                    ↳ QDP

                                                                                    ↳ QDP

                                                                                      ↳ Instantiation

                                                                                        ↳ QDP

                                                                                          ↳ ForwardInstantiation

                                                                                            ↳ QDP

                                                                                              ↳ ForwardInstantiation

                                                                                                ↳ QDP

                                                                                                  ↳ ForwardInstantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map38(x0, x1, Succ(y_2), Zero, Zero, x3) → new_map40(x0, x1, Succ(y_2), x3)
new_map38(y0, y1, Succ(x0), Zero, Succ(y3), y4) → new_map39(y0, Succ(x0), Succ(x0), Succ(x0), y4)
new_map40(y0, y1, Succ(x0), y3) → new_map39(y0, Succ(x0), Succ(x0), Succ(x0), y3)
new_map38(x0, x1, Succ(y_2), Succ(Zero), Succ(Zero), x5) → new_map38(x0, x1, Succ(y_2), Zero, Zero, x5)
new_map38(x0, x1, Succ(y_2), Succ(Zero), Succ(Succ(y_3)), x5) → new_map38(x0, x1, Succ(y_2), Zero, Succ(y_3), x5)
new_map38(x0, x1, x2, Succ(Succ(y_3)), Succ(Succ(y_4)), x5) → new_map38(x0, x1, x2, Succ(y_3), Succ(y_4), x5)
new_map39(z0, Succ(z2), Succ(z2), Succ(z2), z3) → new_map38(z0, Succ(z2), Succ(z2), Succ(z2), Succ(z0), z3)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map39(z0, Succ(z2), Succ(z2), Succ(z2), z3) → new_map38(z0, Succ(z2), Succ(z2), Succ(z2), Succ(z0), z3) we obtained the following new rules:

new_map39(Succ(y_3), Succ(Zero), Succ(Zero), Succ(Zero), x2) → new_map38(Succ(y_3), Succ(Zero), Succ(Zero), Succ(Zero), Succ(Succ(y_3)), x2)
new_map39(Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2) → new_map38(Zero, Succ(Zero), Succ(Zero), Succ(Zero), Succ(Zero), x2)
new_map39(Succ(y_4), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), x2) → new_map38(Succ(y_4), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_4)), x2)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ UsableRulesProof

                                                              ↳ QDP

                                                                ↳ Rewriting

                                                                  ↳ QDP

                                                                    ↳ UsableRulesProof

                                                                      ↳ QDP

                                                                        ↳ QReductionProof

                                                                          ↳ QDP

                                                                            ↳ Instantiation

                                                                              ↳ QDP

                                                                                ↳ DependencyGraphProof

                                                                                  ↳ AND

                                                                                    ↳ QDP

                                                                                    ↳ QDP

                                                                                      ↳ Instantiation

                                                                                        ↳ QDP

                                                                                          ↳ ForwardInstantiation

                                                                                            ↳ QDP

                                                                                              ↳ ForwardInstantiation

                                                                                                ↳ QDP

                                                                                                  ↳ ForwardInstantiation

                                                                                                    ↳ QDP

                                                                                                      ↳ ForwardInstantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map38(x0, x1, Succ(y_2), Zero, Zero, x3) → new_map40(x0, x1, Succ(y_2), x3)
new_map39(Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2) → new_map38(Zero, Succ(Zero), Succ(Zero), Succ(Zero), Succ(Zero), x2)
new_map39(Succ(y_3), Succ(Zero), Succ(Zero), Succ(Zero), x2) → new_map38(Succ(y_3), Succ(Zero), Succ(Zero), Succ(Zero), Succ(Succ(y_3)), x2)
new_map38(y0, y1, Succ(x0), Zero, Succ(y3), y4) → new_map39(y0, Succ(x0), Succ(x0), Succ(x0), y4)
new_map40(y0, y1, Succ(x0), y3) → new_map39(y0, Succ(x0), Succ(x0), Succ(x0), y3)
new_map39(Succ(y_4), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), x2) → new_map38(Succ(y_4), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_4)), x2)
new_map38(x0, x1, Succ(y_2), Succ(Zero), Succ(Zero), x5) → new_map38(x0, x1, Succ(y_2), Zero, Zero, x5)
new_map38(x0, x1, Succ(y_2), Succ(Zero), Succ(Succ(y_3)), x5) → new_map38(x0, x1, Succ(y_2), Zero, Succ(y_3), x5)
new_map38(x0, x1, x2, Succ(Succ(y_3)), Succ(Succ(y_4)), x5) → new_map38(x0, x1, x2, Succ(y_3), Succ(y_4), x5)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map40(y0, y1, Succ(x0), y3) → new_map39(y0, Succ(x0), Succ(x0), Succ(x0), y3) we obtained the following new rules:

new_map40(Zero, x1, Succ(Zero), x3) → new_map39(Zero, Succ(Zero), Succ(Zero), Succ(Zero), x3)
new_map40(Succ(y_0), x1, Succ(Zero), x3) → new_map39(Succ(y_0), Succ(Zero), Succ(Zero), Succ(Zero), x3)
new_map40(Succ(y_0), x1, Succ(Succ(y_1)), x3) → new_map39(Succ(y_0), Succ(Succ(y_1)), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ UsableRulesProof

                                                              ↳ QDP

                                                                ↳ Rewriting

                                                                  ↳ QDP

                                                                    ↳ UsableRulesProof

                                                                      ↳ QDP

                                                                        ↳ QReductionProof

                                                                          ↳ QDP

                                                                            ↳ Instantiation

                                                                              ↳ QDP

                                                                                ↳ DependencyGraphProof

                                                                                  ↳ AND

                                                                                    ↳ QDP

                                                                                    ↳ QDP

                                                                                      ↳ Instantiation

                                                                                        ↳ QDP

                                                                                          ↳ ForwardInstantiation

                                                                                            ↳ QDP

                                                                                              ↳ ForwardInstantiation

                                                                                                ↳ QDP

                                                                                                  ↳ ForwardInstantiation

                                                                                                    ↳ QDP

                                                                                                      ↳ ForwardInstantiation

                                                                                                        ↳ QDP

                                                                                                          ↳ ForwardInstantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map40(Zero, x1, Succ(Zero), x3) → new_map39(Zero, Succ(Zero), Succ(Zero), Succ(Zero), x3)
new_map40(Succ(y_0), x1, Succ(Zero), x3) → new_map39(Succ(y_0), Succ(Zero), Succ(Zero), Succ(Zero), x3)
new_map38(x0, x1, Succ(y_2), Zero, Zero, x3) → new_map40(x0, x1, Succ(y_2), x3)
new_map39(Succ(y_3), Succ(Zero), Succ(Zero), Succ(Zero), x2) → new_map38(Succ(y_3), Succ(Zero), Succ(Zero), Succ(Zero), Succ(Succ(y_3)), x2)
new_map39(Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2) → new_map38(Zero, Succ(Zero), Succ(Zero), Succ(Zero), Succ(Zero), x2)
new_map38(y0, y1, Succ(x0), Zero, Succ(y3), y4) → new_map39(y0, Succ(x0), Succ(x0), Succ(x0), y4)
new_map40(Succ(y_0), x1, Succ(Succ(y_1)), x3) → new_map39(Succ(y_0), Succ(Succ(y_1)), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map38(x0, x1, Succ(y_2), Succ(Zero), Succ(Zero), x5) → new_map38(x0, x1, Succ(y_2), Zero, Zero, x5)
new_map39(Succ(y_4), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), x2) → new_map38(Succ(y_4), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_4)), x2)
new_map38(x0, x1, Succ(y_2), Succ(Zero), Succ(Succ(y_3)), x5) → new_map38(x0, x1, Succ(y_2), Zero, Succ(y_3), x5)
new_map38(x0, x1, x2, Succ(Succ(y_3)), Succ(Succ(y_4)), x5) → new_map38(x0, x1, x2, Succ(y_3), Succ(y_4), x5)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map38(y0, y1, Succ(x0), Zero, Succ(y3), y4) → new_map39(y0, Succ(x0), Succ(x0), Succ(x0), y4) we obtained the following new rules:

new_map38(Zero, x1, Succ(Zero), Zero, Succ(x3), x4) → new_map39(Zero, Succ(Zero), Succ(Zero), Succ(Zero), x4)
new_map38(Succ(y_0), x1, Succ(Zero), Zero, Succ(x3), x4) → new_map39(Succ(y_0), Succ(Zero), Succ(Zero), Succ(Zero), x4)
new_map38(Succ(y_0), x1, Succ(Succ(y_1)), Zero, Succ(x3), x4) → new_map39(Succ(y_0), Succ(Succ(y_1)), Succ(Succ(y_1)), Succ(Succ(y_1)), x4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ UsableRulesProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ UsableRulesProof

                                                              ↳ QDP

                                                                ↳ Rewriting

                                                                  ↳ QDP

                                                                    ↳ UsableRulesProof

                                                                      ↳ QDP

                                                                        ↳ QReductionProof

                                                                          ↳ QDP

                                                                            ↳ Instantiation

                                                                              ↳ QDP

                                                                                ↳ DependencyGraphProof

                                                                                  ↳ AND

                                                                                    ↳ QDP

                                                                                    ↳ QDP

                                                                                      ↳ Instantiation

                                                                                        ↳ QDP

                                                                                          ↳ ForwardInstantiation

                                                                                            ↳ QDP

                                                                                              ↳ ForwardInstantiation

                                                                                                ↳ QDP

                                                                                                  ↳ ForwardInstantiation

                                                                                                    ↳ QDP

                                                                                                      ↳ ForwardInstantiation

                                                                                                        ↳ QDP

                                                                                                          ↳ ForwardInstantiation

                                                                                                            ↳ QDP

                                                                                                              ↳ NonTerminationProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map40(Succ(y_0), x1, Succ(Zero), x3) → new_map39(Succ(y_0), Succ(Zero), Succ(Zero), Succ(Zero), x3)
new_map38(x0, x1, Succ(y_2), Zero, Zero, x3) → new_map40(x0, x1, Succ(y_2), x3)
new_map39(Succ(y_3), Succ(Zero), Succ(Zero), Succ(Zero), x2) → new_map38(Succ(y_3), Succ(Zero), Succ(Zero), Succ(Zero), Succ(Succ(y_3)), x2)
new_map40(Succ(y_0), x1, Succ(Succ(y_1)), x3) → new_map39(Succ(y_0), Succ(Succ(y_1)), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map38(x0, x1, Succ(y_2), Succ(Zero), Succ(Zero), x5) → new_map38(x0, x1, Succ(y_2), Zero, Zero, x5)
new_map39(Succ(y_4), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), x2) → new_map38(Succ(y_4), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_3)), Succ(Succ(y_4)), x2)
new_map38(x0, x1, x2, Succ(Succ(y_3)), Succ(Succ(y_4)), x5) → new_map38(x0, x1, x2, Succ(y_3), Succ(y_4), x5)
new_map40(Zero, x1, Succ(Zero), x3) → new_map39(Zero, Succ(Zero), Succ(Zero), Succ(Zero), x3)
new_map39(Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2) → new_map38(Zero, Succ(Zero), Succ(Zero), Succ(Zero), Succ(Zero), x2)
new_map38(Zero, x1, Succ(Zero), Zero, Succ(x3), x4) → new_map39(Zero, Succ(Zero), Succ(Zero), Succ(Zero), x4)
new_map38(Succ(y_0), x1, Succ(Zero), Zero, Succ(x3), x4) → new_map39(Succ(y_0), Succ(Zero), Succ(Zero), Succ(Zero), x4)
new_map38(x0, x1, Succ(y_2), Succ(Zero), Succ(Succ(y_3)), x5) → new_map38(x0, x1, Succ(y_2), Zero, Succ(y_3), x5)
new_map38(Succ(y_0), x1, Succ(Succ(y_1)), Zero, Succ(x3), x4) → new_map39(Succ(y_0), Succ(Succ(y_1)), Succ(Succ(y_1)), Succ(Succ(y_1)), x4)

The TRS R consists of the following rules:none

s = new_map38(Succ(y_0), x1', Succ(Zero), Succ(Zero), Succ(Succ(y_3)), x5) evaluates to t =new_map38(Succ(y_0), Succ(Zero), Succ(Zero), Succ(Zero), Succ(Succ(y_0)), x5)

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:

Matcher: [x1' / Succ(Zero), y_3 / y_0]
Semiunifier: [ ]

Rewriting sequence

new_map38(Succ(y_0), x1', Succ(Zero), Succ(Zero), Succ(Succ(y_3)), x5) → new_map38(Succ(y_0), x1', Succ(Zero), Zero, Succ(y_3), x5)
with rule new_map38(x0, x1'', Succ(y_2), Succ(Zero), Succ(Succ(y_3')), x5') → new_map38(x0, x1'', Succ(y_2), Zero, Succ(y_3'), x5') at position [] and matcher [y_2 / Zero, x1'' / x1', y_3' / y_3, x0 / Succ(y_0), x5' / x5]

new_map38(Succ(y_0), x1', Succ(Zero), Zero, Succ(y_3), x5) → new_map39(Succ(y_0), Succ(Zero), Succ(Zero), Succ(Zero), x5)
with rule new_map38(Succ(y_0'), x1, Succ(Zero), Zero, Succ(x3), x4) → new_map39(Succ(y_0'), Succ(Zero), Succ(Zero), Succ(Zero), x4) at position [] and matcher [x1 / x1', x4 / x5, y_0' / y_0, x3 / y_3]

new_map39(Succ(y_0), Succ(Zero), Succ(Zero), Succ(Zero), x5) → new_map38(Succ(y_0), Succ(Zero), Succ(Zero), Succ(Zero), Succ(Succ(y_0)), x5)
with rule new_map39(Succ(y_3), Succ(Zero), Succ(Zero), Succ(Zero), x2) → new_map38(Succ(y_3), Succ(Zero), Succ(Zero), Succ(Zero), Succ(Succ(y_3)), x2)

Now applying the matcher to the start term leads to a term which is equal to the last term in the rewriting sequence

All these steps are and every following step will be a correct step w.r.t to Q.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map41(wy252, wy253, wy254, wy255, Zero, Zero, ba) → new_map43(wy252, wy253, wy254, wy255, ba)
new_map43(wy252, wy253, wy254, wy255, ba) → new_map42(wy252, new_primPlusNat0(Succ(wy254), wy255), wy254, new_primPlusNat0(Succ(wy254), wy255), new_primPlusNat0(Succ(wy254), wy255), ba)
new_map42(wy107, wy177, wy1090, wy178, Succ(wy1790), bb) → new_map41(wy107, wy177, wy1090, wy178, Succ(wy1790), Succ(wy107), bb)
new_map41(wy252, wy253, wy254, wy255, Zero, Succ(wy2570), ba) → new_map42(wy252, new_primPlusNat0(Succ(wy254), wy255), wy254, new_primPlusNat0(Succ(wy254), wy255), new_primPlusNat0(Succ(wy254), wy255), ba)
new_map42(wy107, wy177, wy1090, wy178, Zero, bb) → new_map41(wy107, wy177, wy1090, wy178, Zero, Succ(wy107), bb)
new_map41(wy252, wy253, wy254, wy255, Succ(wy2560), Succ(wy2570), ba) → new_map41(wy252, wy253, wy254, wy255, wy2560, wy2570, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_map42(wy107, wy177, wy1090, wy178, Zero, bb) → new_map41(wy107, wy177, wy1090, wy178, Zero, Succ(wy107), bb)

The remaining pairs can at least be oriented weakly.

new_map41(wy252, wy253, wy254, wy255, Zero, Zero, ba) → new_map43(wy252, wy253, wy254, wy255, ba)
new_map43(wy252, wy253, wy254, wy255, ba) → new_map42(wy252, new_primPlusNat0(Succ(wy254), wy255), wy254, new_primPlusNat0(Succ(wy254), wy255), new_primPlusNat0(Succ(wy254), wy255), ba)
new_map42(wy107, wy177, wy1090, wy178, Succ(wy1790), bb) → new_map41(wy107, wy177, wy1090, wy178, Succ(wy1790), Succ(wy107), bb)
new_map41(wy252, wy253, wy254, wy255, Zero, Succ(wy2570), ba) → new_map42(wy252, new_primPlusNat0(Succ(wy254), wy255), wy254, new_primPlusNat0(Succ(wy254), wy255), new_primPlusNat0(Succ(wy254), wy255), ba)
new_map41(wy252, wy253, wy254, wy255, Succ(wy2560), Succ(wy2570), ba) → new_map41(wy252, wy253, wy254, wy255, wy2560, wy2570, ba)

Used ordering: Polynomial interpretation [25]:

POL(Succ(x₁)) = 0
POL(Zero) = 1
POL(new_map41(x₁, x₂, x₃, x₄, x₅, x₆, x₇)) = 1
POL(new_map42(x₁, x₂, x₃, x₄, x₅, x₆)) = 1 + x₅
POL(new_map43(x₁, x₂, x₃, x₄, x₅)) = 1
POL(new_primPlusNat0(x₁, x₂)) = 0

The following usable rules [17] were oriented:

new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map43(wy252, wy253, wy254, wy255, ba) → new_map42(wy252, new_primPlusNat0(Succ(wy254), wy255), wy254, new_primPlusNat0(Succ(wy254), wy255), new_primPlusNat0(Succ(wy254), wy255), ba)
new_map41(wy252, wy253, wy254, wy255, Zero, Zero, ba) → new_map43(wy252, wy253, wy254, wy255, ba)
new_map42(wy107, wy177, wy1090, wy178, Succ(wy1790), bb) → new_map41(wy107, wy177, wy1090, wy178, Succ(wy1790), Succ(wy107), bb)
new_map41(wy252, wy253, wy254, wy255, Zero, Succ(wy2570), ba) → new_map42(wy252, new_primPlusNat0(Succ(wy254), wy255), wy254, new_primPlusNat0(Succ(wy254), wy255), new_primPlusNat0(Succ(wy254), wy255), ba)
new_map41(wy252, wy253, wy254, wy255, Succ(wy2560), Succ(wy2570), ba) → new_map41(wy252, wy253, wy254, wy255, wy2560, wy2570, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule new_map43(wy252, wy253, wy254, wy255, ba) → new_map42(wy252, new_primPlusNat0(Succ(wy254), wy255), wy254, new_primPlusNat0(Succ(wy254), wy255), new_primPlusNat0(Succ(wy254), wy255), ba) at position [4] we obtained the following new rules:

new_map43(y0, y1, x0, Zero, y4) → new_map42(y0, new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y4)
new_map43(y0, y1, x0, Succ(x1), y4) → new_map42(y0, new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map43(y0, y1, x0, Zero, y4) → new_map42(y0, new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y4)
new_map41(wy252, wy253, wy254, wy255, Zero, Zero, ba) → new_map43(wy252, wy253, wy254, wy255, ba)
new_map43(y0, y1, x0, Succ(x1), y4) → new_map42(y0, new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map42(wy107, wy177, wy1090, wy178, Succ(wy1790), bb) → new_map41(wy107, wy177, wy1090, wy178, Succ(wy1790), Succ(wy107), bb)
new_map41(wy252, wy253, wy254, wy255, Zero, Succ(wy2570), ba) → new_map42(wy252, new_primPlusNat0(Succ(wy254), wy255), wy254, new_primPlusNat0(Succ(wy254), wy255), new_primPlusNat0(Succ(wy254), wy255), ba)
new_map41(wy252, wy253, wy254, wy255, Succ(wy2560), Succ(wy2570), ba) → new_map41(wy252, wy253, wy254, wy255, wy2560, wy2570, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map43(y0, y1, x0, Zero, y4) → new_map42(y0, new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y4) at position [1] we obtained the following new rules:

new_map43(y0, y1, x0, Zero, y4) → new_map42(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map41(wy252, wy253, wy254, wy255, Zero, Zero, ba) → new_map43(wy252, wy253, wy254, wy255, ba)
new_map43(y0, y1, x0, Succ(x1), y4) → new_map42(y0, new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map42(wy107, wy177, wy1090, wy178, Succ(wy1790), bb) → new_map41(wy107, wy177, wy1090, wy178, Succ(wy1790), Succ(wy107), bb)
new_map41(wy252, wy253, wy254, wy255, Zero, Succ(wy2570), ba) → new_map42(wy252, new_primPlusNat0(Succ(wy254), wy255), wy254, new_primPlusNat0(Succ(wy254), wy255), new_primPlusNat0(Succ(wy254), wy255), ba)
new_map41(wy252, wy253, wy254, wy255, Succ(wy2560), Succ(wy2570), ba) → new_map41(wy252, wy253, wy254, wy255, wy2560, wy2570, ba)
new_map43(y0, y1, x0, Zero, y4) → new_map42(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y4)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map43(y0, y1, x0, Succ(x1), y4) → new_map42(y0, new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y4) at position [1] we obtained the following new rules:

new_map43(y0, y1, x0, Succ(x1), y4) → new_map42(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map41(wy252, wy253, wy254, wy255, Zero, Zero, ba) → new_map43(wy252, wy253, wy254, wy255, ba)
new_map42(wy107, wy177, wy1090, wy178, Succ(wy1790), bb) → new_map41(wy107, wy177, wy1090, wy178, Succ(wy1790), Succ(wy107), bb)
new_map41(wy252, wy253, wy254, wy255, Zero, Succ(wy2570), ba) → new_map42(wy252, new_primPlusNat0(Succ(wy254), wy255), wy254, new_primPlusNat0(Succ(wy254), wy255), new_primPlusNat0(Succ(wy254), wy255), ba)
new_map43(y0, y1, x0, Succ(x1), y4) → new_map42(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map41(wy252, wy253, wy254, wy255, Succ(wy2560), Succ(wy2570), ba) → new_map41(wy252, wy253, wy254, wy255, wy2560, wy2570, ba)
new_map43(y0, y1, x0, Zero, y4) → new_map42(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y4)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map43(y0, y1, x0, Zero, y4) → new_map42(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y4) at position [3] we obtained the following new rules:

new_map43(y0, y1, x0, Zero, y4) → new_map42(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map41(wy252, wy253, wy254, wy255, Zero, Zero, ba) → new_map43(wy252, wy253, wy254, wy255, ba)
new_map42(wy107, wy177, wy1090, wy178, Succ(wy1790), bb) → new_map41(wy107, wy177, wy1090, wy178, Succ(wy1790), Succ(wy107), bb)
new_map41(wy252, wy253, wy254, wy255, Zero, Succ(wy2570), ba) → new_map42(wy252, new_primPlusNat0(Succ(wy254), wy255), wy254, new_primPlusNat0(Succ(wy254), wy255), new_primPlusNat0(Succ(wy254), wy255), ba)
new_map43(y0, y1, x0, Zero, y4) → new_map42(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4)
new_map43(y0, y1, x0, Succ(x1), y4) → new_map42(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map41(wy252, wy253, wy254, wy255, Succ(wy2560), Succ(wy2570), ba) → new_map41(wy252, wy253, wy254, wy255, wy2560, wy2570, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map43(y0, y1, x0, Succ(x1), y4) → new_map42(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y4) at position [3] we obtained the following new rules:

new_map43(y0, y1, x0, Succ(x1), y4) → new_map42(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map41(wy252, wy253, wy254, wy255, Zero, Zero, ba) → new_map43(wy252, wy253, wy254, wy255, ba)
new_map42(wy107, wy177, wy1090, wy178, Succ(wy1790), bb) → new_map41(wy107, wy177, wy1090, wy178, Succ(wy1790), Succ(wy107), bb)
new_map43(y0, y1, x0, Succ(x1), y4) → new_map42(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map41(wy252, wy253, wy254, wy255, Zero, Succ(wy2570), ba) → new_map42(wy252, new_primPlusNat0(Succ(wy254), wy255), wy254, new_primPlusNat0(Succ(wy254), wy255), new_primPlusNat0(Succ(wy254), wy255), ba)
new_map43(y0, y1, x0, Zero, y4) → new_map42(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4)
new_map41(wy252, wy253, wy254, wy255, Succ(wy2560), Succ(wy2570), ba) → new_map41(wy252, wy253, wy254, wy255, wy2560, wy2570, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule new_map41(wy252, wy253, wy254, wy255, Zero, Succ(wy2570), ba) → new_map42(wy252, new_primPlusNat0(Succ(wy254), wy255), wy254, new_primPlusNat0(Succ(wy254), wy255), new_primPlusNat0(Succ(wy254), wy255), ba) at position [4] we obtained the following new rules:

new_map41(y0, y1, x0, Succ(x1), Zero, Succ(y4), y5) → new_map42(y0, new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map41(y0, y1, x0, Zero, Zero, Succ(y4), y5) → new_map42(y0, new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map41(wy252, wy253, wy254, wy255, Zero, Zero, ba) → new_map43(wy252, wy253, wy254, wy255, ba)
new_map42(wy107, wy177, wy1090, wy178, Succ(wy1790), bb) → new_map41(wy107, wy177, wy1090, wy178, Succ(wy1790), Succ(wy107), bb)
new_map43(y0, y1, x0, Succ(x1), y4) → new_map42(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map43(y0, y1, x0, Zero, y4) → new_map42(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4)
new_map41(y0, y1, x0, Succ(x1), Zero, Succ(y4), y5) → new_map42(y0, new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map41(wy252, wy253, wy254, wy255, Succ(wy2560), Succ(wy2570), ba) → new_map41(wy252, wy253, wy254, wy255, wy2560, wy2570, ba)
new_map41(y0, y1, x0, Zero, Zero, Succ(y4), y5) → new_map42(y0, new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map41(y0, y1, x0, Succ(x1), Zero, Succ(y4), y5) → new_map42(y0, new_primPlusNat0(Succ(x0), Succ(x1)), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5) at position [1] we obtained the following new rules:

new_map41(y0, y1, x0, Succ(x1), Zero, Succ(y4), y5) → new_map42(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map41(y0, y1, x0, Succ(x1), Zero, Succ(y4), y5) → new_map42(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map41(wy252, wy253, wy254, wy255, Zero, Zero, ba) → new_map43(wy252, wy253, wy254, wy255, ba)
new_map42(wy107, wy177, wy1090, wy178, Succ(wy1790), bb) → new_map41(wy107, wy177, wy1090, wy178, Succ(wy1790), Succ(wy107), bb)
new_map43(y0, y1, x0, Succ(x1), y4) → new_map42(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map43(y0, y1, x0, Zero, y4) → new_map42(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4)
new_map41(wy252, wy253, wy254, wy255, Succ(wy2560), Succ(wy2570), ba) → new_map41(wy252, wy253, wy254, wy255, wy2560, wy2570, ba)
new_map41(y0, y1, x0, Zero, Zero, Succ(y4), y5) → new_map42(y0, new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map41(y0, y1, x0, Zero, Zero, Succ(y4), y5) → new_map42(y0, new_primPlusNat0(Succ(x0), Zero), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5) at position [1] we obtained the following new rules:

new_map41(y0, y1, x0, Zero, Zero, Succ(y4), y5) → new_map42(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map41(wy252, wy253, wy254, wy255, Zero, Zero, ba) → new_map43(wy252, wy253, wy254, wy255, ba)
new_map41(y0, y1, x0, Succ(x1), Zero, Succ(y4), y5) → new_map42(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map42(wy107, wy177, wy1090, wy178, Succ(wy1790), bb) → new_map41(wy107, wy177, wy1090, wy178, Succ(wy1790), Succ(wy107), bb)
new_map43(y0, y1, x0, Succ(x1), y4) → new_map42(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map43(y0, y1, x0, Zero, y4) → new_map42(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4)
new_map41(y0, y1, x0, Zero, Zero, Succ(y4), y5) → new_map42(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5)
new_map41(wy252, wy253, wy254, wy255, Succ(wy2560), Succ(wy2570), ba) → new_map41(wy252, wy253, wy254, wy255, wy2560, wy2570, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map41(y0, y1, x0, Succ(x1), Zero, Succ(y4), y5) → new_map42(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, new_primPlusNat0(Succ(x0), Succ(x1)), Succ(Succ(new_primPlusNat0(x0, x1))), y5) at position [3] we obtained the following new rules:

new_map41(y0, y1, x0, Succ(x1), Zero, Succ(y4), y5) → new_map42(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map41(y0, y1, x0, Succ(x1), Zero, Succ(y4), y5) → new_map42(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map41(wy252, wy253, wy254, wy255, Zero, Zero, ba) → new_map43(wy252, wy253, wy254, wy255, ba)
new_map42(wy107, wy177, wy1090, wy178, Succ(wy1790), bb) → new_map41(wy107, wy177, wy1090, wy178, Succ(wy1790), Succ(wy107), bb)
new_map43(y0, y1, x0, Succ(x1), y4) → new_map42(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map43(y0, y1, x0, Zero, y4) → new_map42(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4)
new_map41(y0, y1, x0, Zero, Zero, Succ(y4), y5) → new_map42(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5)
new_map41(wy252, wy253, wy254, wy255, Succ(wy2560), Succ(wy2570), ba) → new_map41(wy252, wy253, wy254, wy255, wy2560, wy2570, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule new_map41(y0, y1, x0, Zero, Zero, Succ(y4), y5) → new_map42(y0, Succ(x0), x0, new_primPlusNat0(Succ(x0), Zero), Succ(x0), y5) at position [3] we obtained the following new rules:

new_map41(y0, y1, x0, Zero, Zero, Succ(y4), y5) → new_map42(y0, Succ(x0), x0, Succ(x0), Succ(x0), y5)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Instantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map41(wy252, wy253, wy254, wy255, Zero, Zero, ba) → new_map43(wy252, wy253, wy254, wy255, ba)
new_map41(y0, y1, x0, Succ(x1), Zero, Succ(y4), y5) → new_map42(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map42(wy107, wy177, wy1090, wy178, Succ(wy1790), bb) → new_map41(wy107, wy177, wy1090, wy178, Succ(wy1790), Succ(wy107), bb)
new_map43(y0, y1, x0, Succ(x1), y4) → new_map42(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map43(y0, y1, x0, Zero, y4) → new_map42(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4)
new_map41(y0, y1, x0, Zero, Zero, Succ(y4), y5) → new_map42(y0, Succ(x0), x0, Succ(x0), Succ(x0), y5)
new_map41(wy252, wy253, wy254, wy255, Succ(wy2560), Succ(wy2570), ba) → new_map41(wy252, wy253, wy254, wy255, wy2560, wy2570, ba)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule new_map42(wy107, wy177, wy1090, wy178, Succ(wy1790), bb) → new_map41(wy107, wy177, wy1090, wy178, Succ(wy1790), Succ(wy107), bb) we obtained the following new rules:

new_map42(z0, Succ(z2), z2, Succ(z2), Succ(z2), z3) → new_map41(z0, Succ(z2), z2, Succ(z2), Succ(z2), Succ(z0), z3)
new_map42(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z4) → new_map41(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), Succ(z0), z4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ ForwardInstantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map41(y0, y1, x0, Succ(x1), Zero, Succ(y4), y5) → new_map42(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map41(wy252, wy253, wy254, wy255, Zero, Zero, ba) → new_map43(wy252, wy253, wy254, wy255, ba)
new_map42(z0, Succ(z2), z2, Succ(z2), Succ(z2), z3) → new_map41(z0, Succ(z2), z2, Succ(z2), Succ(z2), Succ(z0), z3)
new_map43(y0, y1, x0, Succ(x1), y4) → new_map42(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map43(y0, y1, x0, Zero, y4) → new_map42(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4)
new_map42(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z4) → new_map41(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), Succ(z0), z4)
new_map41(wy252, wy253, wy254, wy255, Succ(wy2560), Succ(wy2570), ba) → new_map41(wy252, wy253, wy254, wy255, wy2560, wy2570, ba)
new_map41(y0, y1, x0, Zero, Zero, Succ(y4), y5) → new_map42(y0, Succ(x0), x0, Succ(x0), Succ(x0), y5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map41(wy252, wy253, wy254, wy255, Zero, Zero, ba) → new_map43(wy252, wy253, wy254, wy255, ba) we obtained the following new rules:

new_map41(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map43(x0, x1, x2, Succ(y_3), x4)
new_map41(x0, x1, x2, Zero, Zero, Zero, x4) → new_map43(x0, x1, x2, Zero, x4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ ForwardInstantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map41(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map43(x0, x1, x2, Succ(y_3), x4)
new_map41(y0, y1, x0, Succ(x1), Zero, Succ(y4), y5) → new_map42(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map41(x0, x1, x2, Zero, Zero, Zero, x4) → new_map43(x0, x1, x2, Zero, x4)
new_map42(z0, Succ(z2), z2, Succ(z2), Succ(z2), z3) → new_map41(z0, Succ(z2), z2, Succ(z2), Succ(z2), Succ(z0), z3)
new_map43(y0, y1, x0, Succ(x1), y4) → new_map42(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map43(y0, y1, x0, Zero, y4) → new_map42(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4)
new_map41(y0, y1, x0, Zero, Zero, Succ(y4), y5) → new_map42(y0, Succ(x0), x0, Succ(x0), Succ(x0), y5)
new_map41(wy252, wy253, wy254, wy255, Succ(wy2560), Succ(wy2570), ba) → new_map41(wy252, wy253, wy254, wy255, wy2560, wy2570, ba)
new_map42(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z4) → new_map41(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), Succ(z0), z4)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map41(wy252, wy253, wy254, wy255, Succ(wy2560), Succ(wy2570), ba) → new_map41(wy252, wy253, wy254, wy255, wy2560, wy2570, ba) we obtained the following new rules:

new_map41(x0, x1, x2, Zero, Succ(Zero), Succ(Zero), x6) → new_map41(x0, x1, x2, Zero, Zero, Zero, x6)
new_map41(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map41(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map41(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Zero), x6) → new_map41(x0, x1, x2, Succ(y_3), Zero, Zero, x6)
new_map41(x0, x1, x2, Zero, Succ(Zero), Succ(Succ(y_3)), x6) → new_map41(x0, x1, x2, Zero, Zero, Succ(y_3), x6)
new_map41(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Succ(y_4)), x6) → new_map41(x0, x1, x2, Succ(y_3), Zero, Succ(y_4), x6)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ ForwardInstantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map41(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map43(x0, x1, x2, Succ(y_3), x4)
new_map41(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map41(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map42(z0, Succ(z2), z2, Succ(z2), Succ(z2), z3) → new_map41(z0, Succ(z2), z2, Succ(z2), Succ(z2), Succ(z0), z3)
new_map41(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Zero), x6) → new_map41(x0, x1, x2, Succ(y_3), Zero, Zero, x6)
new_map43(y0, y1, x0, Succ(x1), y4) → new_map42(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map42(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z4) → new_map41(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), Succ(z0), z4)
new_map41(x0, x1, x2, Zero, Succ(Zero), Succ(Succ(y_3)), x6) → new_map41(x0, x1, x2, Zero, Zero, Succ(y_3), x6)
new_map41(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Succ(y_4)), x6) → new_map41(x0, x1, x2, Succ(y_3), Zero, Succ(y_4), x6)
new_map41(x0, x1, x2, Zero, Succ(Zero), Succ(Zero), x6) → new_map41(x0, x1, x2, Zero, Zero, Zero, x6)
new_map41(y0, y1, x0, Succ(x1), Zero, Succ(y4), y5) → new_map42(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map41(x0, x1, x2, Zero, Zero, Zero, x4) → new_map43(x0, x1, x2, Zero, x4)
new_map43(y0, y1, x0, Zero, y4) → new_map42(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4)
new_map41(y0, y1, x0, Zero, Zero, Succ(y4), y5) → new_map42(y0, Succ(x0), x0, Succ(x0), Succ(x0), y5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map42(z0, Succ(z2), z2, Succ(z2), Succ(z2), z3) → new_map41(z0, Succ(z2), z2, Succ(z2), Succ(z2), Succ(z0), z3) we obtained the following new rules:

new_map42(Succ(y_4), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map41(Succ(y_4), Succ(Zero), Zero, Succ(Zero), Succ(Zero), Succ(Succ(y_4)), x2)
new_map42(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map41(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2)
new_map42(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map41(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Succ(y_5)), x2)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ ForwardInstantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map41(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map41(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map41(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map43(x0, x1, x2, Succ(y_3), x4)
new_map41(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Zero), x6) → new_map41(x0, x1, x2, Succ(y_3), Zero, Zero, x6)
new_map43(y0, y1, x0, Succ(x1), y4) → new_map42(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map42(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map41(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Succ(y_5)), x2)
new_map42(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map41(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2)
new_map42(Succ(y_4), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map41(Succ(y_4), Succ(Zero), Zero, Succ(Zero), Succ(Zero), Succ(Succ(y_4)), x2)
new_map42(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z4) → new_map41(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), Succ(z0), z4)
new_map41(x0, x1, x2, Zero, Succ(Zero), Succ(Succ(y_3)), x6) → new_map41(x0, x1, x2, Zero, Zero, Succ(y_3), x6)
new_map41(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Succ(y_4)), x6) → new_map41(x0, x1, x2, Succ(y_3), Zero, Succ(y_4), x6)
new_map41(x0, x1, x2, Zero, Succ(Zero), Succ(Zero), x6) → new_map41(x0, x1, x2, Zero, Zero, Zero, x6)
new_map41(y0, y1, x0, Succ(x1), Zero, Succ(y4), y5) → new_map42(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map41(x0, x1, x2, Zero, Zero, Zero, x4) → new_map43(x0, x1, x2, Zero, x4)
new_map43(y0, y1, x0, Zero, y4) → new_map42(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4)
new_map41(y0, y1, x0, Zero, Zero, Succ(y4), y5) → new_map42(y0, Succ(x0), x0, Succ(x0), Succ(x0), y5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map43(y0, y1, x0, Zero, y4) → new_map42(y0, Succ(x0), x0, Succ(x0), Succ(x0), y4) we obtained the following new rules:

new_map43(Succ(y_0), x1, Zero, Zero, x3) → new_map42(Succ(y_0), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x3)
new_map43(Succ(y_0), x1, Succ(y_1), Zero, x3) → new_map42(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map43(x0, x1, Succ(y_1), Zero, x3) → new_map42(x0, Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map43(Zero, x1, Zero, Zero, x3) → new_map42(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x3)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ ForwardInstantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map41(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map43(x0, x1, x2, Succ(y_3), x4)
new_map41(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map41(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map41(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Zero), x6) → new_map41(x0, x1, x2, Succ(y_3), Zero, Zero, x6)
new_map43(y0, y1, x0, Succ(x1), y4) → new_map42(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map42(Succ(y_4), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map41(Succ(y_4), Succ(Zero), Zero, Succ(Zero), Succ(Zero), Succ(Succ(y_4)), x2)
new_map42(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map41(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2)
new_map42(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map41(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Succ(y_5)), x2)
new_map42(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z4) → new_map41(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), Succ(z0), z4)
new_map43(x0, x1, Succ(y_1), Zero, x3) → new_map42(x0, Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map41(x0, x1, x2, Zero, Succ(Zero), Succ(Succ(y_3)), x6) → new_map41(x0, x1, x2, Zero, Zero, Succ(y_3), x6)
new_map43(Zero, x1, Zero, Zero, x3) → new_map42(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x3)
new_map41(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Succ(y_4)), x6) → new_map41(x0, x1, x2, Succ(y_3), Zero, Succ(y_4), x6)
new_map43(Succ(y_0), x1, Zero, Zero, x3) → new_map42(Succ(y_0), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x3)
new_map41(x0, x1, x2, Zero, Succ(Zero), Succ(Zero), x6) → new_map41(x0, x1, x2, Zero, Zero, Zero, x6)
new_map41(y0, y1, x0, Succ(x1), Zero, Succ(y4), y5) → new_map42(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map41(x0, x1, x2, Zero, Zero, Zero, x4) → new_map43(x0, x1, x2, Zero, x4)
new_map43(Succ(y_0), x1, Succ(y_1), Zero, x3) → new_map42(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map41(y0, y1, x0, Zero, Zero, Succ(y4), y5) → new_map42(y0, Succ(x0), x0, Succ(x0), Succ(x0), y5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map41(y0, y1, x0, Zero, Zero, Succ(y4), y5) → new_map42(y0, Succ(x0), x0, Succ(x0), Succ(x0), y5) we obtained the following new rules:

new_map41(Succ(y_0), x1, Succ(y_1), Zero, Zero, Succ(x3), x4) → new_map42(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x4)
new_map41(Zero, x1, Zero, Zero, Zero, Succ(x3), x4) → new_map42(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x4)
new_map41(Succ(y_0), x1, Zero, Zero, Zero, Succ(x3), x4) → new_map42(Succ(y_0), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x4)
new_map41(x0, x1, Succ(y_1), Zero, Zero, Succ(x3), x4) → new_map42(x0, Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ ForwardInstantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                                                                                      ↳ QDP

                                                                                        ↳ ForwardInstantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map41(Succ(y_0), x1, Succ(y_1), Zero, Zero, Succ(x3), x4) → new_map42(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x4)
new_map41(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map41(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map41(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map43(x0, x1, x2, Succ(y_3), x4)
new_map41(Zero, x1, Zero, Zero, Zero, Succ(x3), x4) → new_map42(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x4)
new_map41(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Zero), x6) → new_map41(x0, x1, x2, Succ(y_3), Zero, Zero, x6)
new_map43(y0, y1, x0, Succ(x1), y4) → new_map42(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map42(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map41(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Succ(y_5)), x2)
new_map42(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map41(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2)
new_map42(Succ(y_4), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map41(Succ(y_4), Succ(Zero), Zero, Succ(Zero), Succ(Zero), Succ(Succ(y_4)), x2)
new_map42(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z4) → new_map41(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), Succ(z0), z4)
new_map41(Succ(y_0), x1, Zero, Zero, Zero, Succ(x3), x4) → new_map42(Succ(y_0), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x4)
new_map43(x0, x1, Succ(y_1), Zero, x3) → new_map42(x0, Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map41(x0, x1, x2, Zero, Succ(Zero), Succ(Succ(y_3)), x6) → new_map41(x0, x1, x2, Zero, Zero, Succ(y_3), x6)
new_map41(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Succ(y_4)), x6) → new_map41(x0, x1, x2, Succ(y_3), Zero, Succ(y_4), x6)
new_map43(Zero, x1, Zero, Zero, x3) → new_map42(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x3)
new_map41(x0, x1, x2, Zero, Succ(Zero), Succ(Zero), x6) → new_map41(x0, x1, x2, Zero, Zero, Zero, x6)
new_map43(Succ(y_0), x1, Zero, Zero, x3) → new_map42(Succ(y_0), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x3)
new_map41(y0, y1, x0, Succ(x1), Zero, Succ(y4), y5) → new_map42(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map41(x0, x1, x2, Zero, Zero, Zero, x4) → new_map43(x0, x1, x2, Zero, x4)
new_map43(Succ(y_0), x1, Succ(y_1), Zero, x3) → new_map42(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map41(x0, x1, Succ(y_1), Zero, Zero, Succ(x3), x4) → new_map42(x0, Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x4)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map42(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), z4) → new_map41(z0, Succ(Succ(y_0)), z2, Succ(Succ(y_1)), Succ(Succ(y_2)), Succ(z0), z4) we obtained the following new rules:

new_map42(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map41(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Succ(y_5)), x5)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ ForwardInstantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                                                                                      ↳ QDP

                                                                                        ↳ ForwardInstantiation

                                                                                          ↳ QDP

                                                                                            ↳ ForwardInstantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map41(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map43(x0, x1, x2, Succ(y_3), x4)
new_map41(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map41(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map41(Succ(y_0), x1, Succ(y_1), Zero, Zero, Succ(x3), x4) → new_map42(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x4)
new_map41(Zero, x1, Zero, Zero, Zero, Succ(x3), x4) → new_map42(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x4)
new_map41(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Zero), x6) → new_map41(x0, x1, x2, Succ(y_3), Zero, Zero, x6)
new_map43(y0, y1, x0, Succ(x1), y4) → new_map42(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map42(Succ(y_4), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map41(Succ(y_4), Succ(Zero), Zero, Succ(Zero), Succ(Zero), Succ(Succ(y_4)), x2)
new_map42(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map41(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2)
new_map42(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map41(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Succ(y_5)), x2)
new_map43(x0, x1, Succ(y_1), Zero, x3) → new_map42(x0, Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map41(Succ(y_0), x1, Zero, Zero, Zero, Succ(x3), x4) → new_map42(Succ(y_0), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x4)
new_map41(x0, x1, x2, Zero, Succ(Zero), Succ(Succ(y_3)), x6) → new_map41(x0, x1, x2, Zero, Zero, Succ(y_3), x6)
new_map43(Zero, x1, Zero, Zero, x3) → new_map42(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x3)
new_map41(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Succ(y_4)), x6) → new_map41(x0, x1, x2, Succ(y_3), Zero, Succ(y_4), x6)
new_map43(Succ(y_0), x1, Zero, Zero, x3) → new_map42(Succ(y_0), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x3)
new_map41(x0, x1, x2, Zero, Succ(Zero), Succ(Zero), x6) → new_map41(x0, x1, x2, Zero, Zero, Zero, x6)
new_map41(y0, y1, x0, Succ(x1), Zero, Succ(y4), y5) → new_map42(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map41(x0, x1, x2, Zero, Zero, Zero, x4) → new_map43(x0, x1, x2, Zero, x4)
new_map43(Succ(y_0), x1, Succ(y_1), Zero, x3) → new_map42(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map41(x0, x1, Succ(y_1), Zero, Zero, Succ(x3), x4) → new_map42(x0, Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x4)
new_map42(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map41(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Succ(y_5)), x5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map43(x0, x1, Succ(y_1), Zero, x3) → new_map42(x0, Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x3) we obtained the following new rules:

new_map43(Succ(y_0), x1, Succ(x2), Zero, x3) → new_map42(Succ(y_0), Succ(Succ(x2)), Succ(x2), Succ(Succ(x2)), Succ(Succ(x2)), x3)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ ForwardInstantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                                                                                      ↳ QDP

                                                                                        ↳ ForwardInstantiation

                                                                                          ↳ QDP

                                                                                            ↳ ForwardInstantiation

                                                                                              ↳ QDP

                                                                                                ↳ ForwardInstantiation

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map41(Succ(y_0), x1, Succ(y_1), Zero, Zero, Succ(x3), x4) → new_map42(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x4)
new_map41(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map41(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map41(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map43(x0, x1, x2, Succ(y_3), x4)
new_map41(Zero, x1, Zero, Zero, Zero, Succ(x3), x4) → new_map42(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x4)
new_map41(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Zero), x6) → new_map41(x0, x1, x2, Succ(y_3), Zero, Zero, x6)
new_map43(y0, y1, x0, Succ(x1), y4) → new_map42(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map42(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map41(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Succ(y_5)), x2)
new_map42(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map41(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2)
new_map42(Succ(y_4), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map41(Succ(y_4), Succ(Zero), Zero, Succ(Zero), Succ(Zero), Succ(Succ(y_4)), x2)
new_map41(Succ(y_0), x1, Zero, Zero, Zero, Succ(x3), x4) → new_map42(Succ(y_0), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x4)
new_map41(x0, x1, x2, Zero, Succ(Zero), Succ(Succ(y_3)), x6) → new_map41(x0, x1, x2, Zero, Zero, Succ(y_3), x6)
new_map41(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Succ(y_4)), x6) → new_map41(x0, x1, x2, Succ(y_3), Zero, Succ(y_4), x6)
new_map43(Zero, x1, Zero, Zero, x3) → new_map42(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x3)
new_map41(x0, x1, x2, Zero, Succ(Zero), Succ(Zero), x6) → new_map41(x0, x1, x2, Zero, Zero, Zero, x6)
new_map43(Succ(y_0), x1, Zero, Zero, x3) → new_map42(Succ(y_0), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x3)
new_map41(y0, y1, x0, Succ(x1), Zero, Succ(y4), y5) → new_map42(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map41(x0, x1, x2, Zero, Zero, Zero, x4) → new_map43(x0, x1, x2, Zero, x4)
new_map43(Succ(y_0), x1, Succ(y_1), Zero, x3) → new_map42(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map41(x0, x1, Succ(y_1), Zero, Zero, Succ(x3), x4) → new_map42(x0, Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x4)
new_map42(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map41(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Succ(y_5)), x5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule new_map41(x0, x1, Succ(y_1), Zero, Zero, Succ(x3), x4) → new_map42(x0, Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x4) we obtained the following new rules:

new_map41(Succ(y_0), x1, Succ(x2), Zero, Zero, Succ(x3), x4) → new_map42(Succ(y_0), Succ(Succ(x2)), Succ(x2), Succ(Succ(x2)), Succ(Succ(x2)), x4)

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ ForwardInstantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                                                                                      ↳ QDP

                                                                                        ↳ ForwardInstantiation

                                                                                          ↳ QDP

                                                                                            ↳ ForwardInstantiation

                                                                                              ↳ QDP

                                                                                                ↳ ForwardInstantiation

                                                                                                  ↳ QDP

                                                                                                    ↳ QDPOrderProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map41(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map43(x0, x1, x2, Succ(y_3), x4)
new_map41(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map41(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map41(Succ(y_0), x1, Succ(y_1), Zero, Zero, Succ(x3), x4) → new_map42(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x4)
new_map41(Zero, x1, Zero, Zero, Zero, Succ(x3), x4) → new_map42(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x4)
new_map41(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Zero), x6) → new_map41(x0, x1, x2, Succ(y_3), Zero, Zero, x6)
new_map43(y0, y1, x0, Succ(x1), y4) → new_map42(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map42(Succ(y_4), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map41(Succ(y_4), Succ(Zero), Zero, Succ(Zero), Succ(Zero), Succ(Succ(y_4)), x2)
new_map42(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map41(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2)
new_map42(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map41(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Succ(y_5)), x2)
new_map41(Succ(y_0), x1, Zero, Zero, Zero, Succ(x3), x4) → new_map42(Succ(y_0), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x4)
new_map41(x0, x1, x2, Zero, Succ(Zero), Succ(Succ(y_3)), x6) → new_map41(x0, x1, x2, Zero, Zero, Succ(y_3), x6)
new_map43(Zero, x1, Zero, Zero, x3) → new_map42(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x3)
new_map41(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Succ(y_4)), x6) → new_map41(x0, x1, x2, Succ(y_3), Zero, Succ(y_4), x6)
new_map43(Succ(y_0), x1, Zero, Zero, x3) → new_map42(Succ(y_0), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x3)
new_map41(x0, x1, x2, Zero, Succ(Zero), Succ(Zero), x6) → new_map41(x0, x1, x2, Zero, Zero, Zero, x6)
new_map41(y0, y1, x0, Succ(x1), Zero, Succ(y4), y5) → new_map42(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map41(x0, x1, x2, Zero, Zero, Zero, x4) → new_map43(x0, x1, x2, Zero, x4)
new_map43(Succ(y_0), x1, Succ(y_1), Zero, x3) → new_map42(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map42(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map41(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Succ(y_5)), x5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

new_map41(Succ(y_0), x1, Succ(y_1), Zero, Zero, Succ(x3), x4) → new_map42(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x4)
new_map41(Zero, x1, Zero, Zero, Zero, Succ(x3), x4) → new_map42(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x4)
new_map41(Succ(y_0), x1, Zero, Zero, Zero, Succ(x3), x4) → new_map42(Succ(y_0), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x4)
new_map41(x0, x1, x2, Zero, Zero, Zero, x4) → new_map43(x0, x1, x2, Zero, x4)

The remaining pairs can at least be oriented weakly.

new_map41(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map43(x0, x1, x2, Succ(y_3), x4)
new_map41(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map41(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map41(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Zero), x6) → new_map41(x0, x1, x2, Succ(y_3), Zero, Zero, x6)
new_map43(y0, y1, x0, Succ(x1), y4) → new_map42(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map42(Succ(y_4), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map41(Succ(y_4), Succ(Zero), Zero, Succ(Zero), Succ(Zero), Succ(Succ(y_4)), x2)
new_map42(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map41(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2)
new_map42(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map41(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Succ(y_5)), x2)
new_map41(x0, x1, x2, Zero, Succ(Zero), Succ(Succ(y_3)), x6) → new_map41(x0, x1, x2, Zero, Zero, Succ(y_3), x6)
new_map43(Zero, x1, Zero, Zero, x3) → new_map42(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x3)
new_map41(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Succ(y_4)), x6) → new_map41(x0, x1, x2, Succ(y_3), Zero, Succ(y_4), x6)
new_map43(Succ(y_0), x1, Zero, Zero, x3) → new_map42(Succ(y_0), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x3)
new_map41(x0, x1, x2, Zero, Succ(Zero), Succ(Zero), x6) → new_map41(x0, x1, x2, Zero, Zero, Zero, x6)
new_map41(y0, y1, x0, Succ(x1), Zero, Succ(y4), y5) → new_map42(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map43(Succ(y_0), x1, Succ(y_1), Zero, x3) → new_map42(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map42(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map41(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Succ(y_5)), x5)

Used ordering: Polynomial interpretation [25]:

POL(Succ(x₁)) = 0
POL(Zero) = 1
POL(new_map41(x₁, x₂, x₃, x₄, x₅, x₆, x₇)) = x₄
POL(new_map42(x₁, x₂, x₃, x₄, x₅, x₆)) = 0
POL(new_map43(x₁, x₂, x₃, x₄, x₅)) = 0
POL(new_primPlusNat0(x₁, x₂)) = 0

The following usable rules [17] were oriented: none

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ ForwardInstantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                                                                                      ↳ QDP

                                                                                        ↳ ForwardInstantiation

                                                                                          ↳ QDP

                                                                                            ↳ ForwardInstantiation

                                                                                              ↳ QDP

                                                                                                ↳ ForwardInstantiation

                                                                                                  ↳ QDP

                                                                                                    ↳ QDPOrderProof

                                                                                                      ↳ QDP

                                                                                                        ↳ DependencyGraphProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map41(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map43(x0, x1, x2, Succ(y_3), x4)
new_map41(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map41(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map41(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Zero), x6) → new_map41(x0, x1, x2, Succ(y_3), Zero, Zero, x6)
new_map43(y0, y1, x0, Succ(x1), y4) → new_map42(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map42(Succ(y_4), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map41(Succ(y_4), Succ(Zero), Zero, Succ(Zero), Succ(Zero), Succ(Succ(y_4)), x2)
new_map42(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x2) → new_map41(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), Succ(Zero), x2)
new_map42(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map41(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Succ(y_5)), x2)
new_map41(x0, x1, x2, Zero, Succ(Zero), Succ(Succ(y_3)), x6) → new_map41(x0, x1, x2, Zero, Zero, Succ(y_3), x6)
new_map43(Zero, x1, Zero, Zero, x3) → new_map42(Zero, Succ(Zero), Zero, Succ(Zero), Succ(Zero), x3)
new_map41(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Succ(y_4)), x6) → new_map41(x0, x1, x2, Succ(y_3), Zero, Succ(y_4), x6)
new_map43(Succ(y_0), x1, Zero, Zero, x3) → new_map42(Succ(y_0), Succ(Zero), Zero, Succ(Zero), Succ(Zero), x3)
new_map41(x0, x1, x2, Zero, Succ(Zero), Succ(Zero), x6) → new_map41(x0, x1, x2, Zero, Zero, Zero, x6)
new_map41(y0, y1, x0, Succ(x1), Zero, Succ(y4), y5) → new_map42(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map43(Succ(y_0), x1, Succ(y_1), Zero, x3) → new_map42(Succ(y_0), Succ(Succ(y_1)), Succ(y_1), Succ(Succ(y_1)), Succ(Succ(y_1)), x3)
new_map42(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map41(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Succ(y_5)), x5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 7 less nodes.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ ForwardInstantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                                                                                      ↳ QDP

                                                                                        ↳ ForwardInstantiation

                                                                                          ↳ QDP

                                                                                            ↳ ForwardInstantiation

                                                                                              ↳ QDP

                                                                                                ↳ ForwardInstantiation

                                                                                                  ↳ QDP

                                                                                                    ↳ QDPOrderProof

                                                                                                      ↳ QDP

                                                                                                        ↳ DependencyGraphProof

                                                                                                          ↳ QDP

                                                                                                            ↳ MNOCProof

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map41(y0, y1, x0, Succ(x1), Zero, Succ(y4), y5) → new_map42(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map41(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map43(x0, x1, x2, Succ(y_3), x4)
new_map41(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map41(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map41(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Zero), x6) → new_map41(x0, x1, x2, Succ(y_3), Zero, Zero, x6)
new_map43(y0, y1, x0, Succ(x1), y4) → new_map42(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map42(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map41(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Succ(y_5)), x2)
new_map42(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map41(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Succ(y_5)), x5)
new_map41(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Succ(y_4)), x6) → new_map41(x0, x1, x2, Succ(y_3), Zero, Succ(y_4), x6)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

The set Q consists of the following terms:

new_primPlusNat0(Succ(x0), Zero)
new_primPlusNat0(Zero, Zero)
new_primPlusNat0(Zero, Succ(x0))
new_primPlusNat0(Succ(x0), Succ(x1))

We have to consider all minimal (P,Q,R)-chains.
We use the modular non-overlap check [17] to decrease Q to the empty set.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ Narrowing

                          ↳ QDP

                            ↳ Rewriting

                              ↳ QDP

                                ↳ Rewriting

                                  ↳ QDP

                                    ↳ Rewriting

                                      ↳ QDP

                                        ↳ Rewriting

                                          ↳ QDP

                                            ↳ Narrowing

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Rewriting

                                                      ↳ QDP

                                                        ↳ Rewriting

                                                          ↳ QDP

                                                            ↳ Rewriting

                                                              ↳ QDP

                                                                ↳ Instantiation

                                                                  ↳ QDP

                                                                    ↳ ForwardInstantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                                                                          ↳ QDP

                                                                            ↳ ForwardInstantiation

                                                                              ↳ QDP

                                                                                ↳ ForwardInstantiation

                                                                                  ↳ QDP

                                                                                    ↳ ForwardInstantiation

                                                                                      ↳ QDP

                                                                                        ↳ ForwardInstantiation

                                                                                          ↳ QDP

                                                                                            ↳ ForwardInstantiation

                                                                                              ↳ QDP

                                                                                                ↳ ForwardInstantiation

                                                                                                  ↳ QDP

                                                                                                    ↳ QDPOrderProof

                                                                                                      ↳ QDP

                                                                                                        ↳ DependencyGraphProof

                                                                                                          ↳ QDP

                                                                                                            ↳ MNOCProof

                                                                                                              ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map41(x0, x1, x2, x3, Succ(Succ(y_4)), Succ(Succ(y_5)), x6) → new_map41(x0, x1, x2, x3, Succ(y_4), Succ(y_5), x6)
new_map41(x0, x1, x2, Succ(y_3), Zero, Zero, x4) → new_map43(x0, x1, x2, Succ(y_3), x4)
new_map41(y0, y1, x0, Succ(x1), Zero, Succ(y4), y5) → new_map42(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y5)
new_map41(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Zero), x6) → new_map41(x0, x1, x2, Succ(y_3), Zero, Zero, x6)
new_map43(y0, y1, x0, Succ(x1), y4) → new_map42(y0, Succ(Succ(new_primPlusNat0(x0, x1))), x0, Succ(Succ(new_primPlusNat0(x0, x1))), Succ(Succ(new_primPlusNat0(x0, x1))), y4)
new_map42(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), x2) → new_map41(Succ(y_5), Succ(Succ(y_4)), Succ(y_4), Succ(Succ(y_4)), Succ(Succ(y_4)), Succ(Succ(y_5)), x2)
new_map41(x0, x1, x2, Succ(y_3), Succ(Zero), Succ(Succ(y_4)), x6) → new_map41(x0, x1, x2, Succ(y_3), Zero, Succ(y_4), x6)
new_map42(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), x5) → new_map41(Succ(y_5), Succ(Succ(x1)), x2, Succ(Succ(x3)), Succ(Succ(x4)), Succ(Succ(y_5)), x5)

The TRS R consists of the following rules:

new_primPlusNat0(Zero, Zero) → Zero
new_primPlusNat0(Succ(wy1050), Zero) → Succ(wy1050)
new_primPlusNat0(Zero, Succ(wy1040)) → Succ(wy1040)
new_primPlusNat0(Succ(wy1050), Succ(wy1040)) → Succ(Succ(new_primPlusNat0(wy1050, wy1040)))

Q is empty.
We have to consider all (P,Q,R)-chains.

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPSizeChangeProof

                  ↳ QDP

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map44(wy237, Succ(wy2380), Succ(wy2390), wy240, ba) → new_map44(wy237, wy2380, wy2390, wy240, ba)

From the DPs we obtained the following set of size-change graphs:

new_map44(wy237, Succ(wy2380), Succ(wy2390), wy240, ba) → new_map44(wy237, wy2380, wy2390, wy240, ba)
The graph contains the following edges 1 >= 1, 2 > 2, 3 > 3, 4 >= 4, 5 >= 5

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPSizeChangeProof

                  ↳ QDP

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map45(wy107, wy108, wy109, Succ(wy1100), Succ(wy1110), ba) → new_map45(wy107, wy108, wy109, wy1100, wy1110, ba)

From the DPs we obtained the following set of size-change graphs:

new_map45(wy107, wy108, wy109, Succ(wy1100), Succ(wy1110), ba) → new_map45(wy107, wy108, wy109, wy1100, wy1110, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 > 4, 5 > 5, 6 >= 6

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPSizeChangeProof

              ↳ Narrow

Q DP problem:
The TRS P consists of the following rules:

new_map46(wy30, wy31, wy32, Succ(wy330), Succ(wy340), ba, bb) → new_map46(wy30, wy31, wy32, wy330, wy340, ba, bb)

From the DPs we obtained the following set of size-change graphs:

new_map46(wy30, wy31, wy32, Succ(wy330), Succ(wy340), ba, bb) → new_map46(wy30, wy31, wy32, wy330, wy340, ba, bb)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 > 4, 5 > 5, 6 >= 6, 7 >= 7

Haskell To QDPs

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                    ↳ NonTerminationProof

                  ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

new_map([]) → new_map([])

R is empty.
Q is empty.
We have to consider all (P,Q,R)-chains.
We used the non-termination processor [17] to show that the DP problem is infinite.
Found a loop by semiunifying a rule from P directly.

The TRS P consists of the following rules:

new_map([]) → new_map([])

The TRS R consists of the following rules:none

s = new_map([]) evaluates to t =new_map([])

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:

Semiunifier: [ ]
Matcher: [ ]

Rewriting sequence

The DP semiunifies directly so there is only one rewrite step from new_map([]) to new_map([]).

↳ HASKELL

  ↳ BR

    ↳ HASKELL

      ↳ COR

        ↳ HASKELL

          ↳ LetRed

            ↳ HASKELL

              ↳ Narrow

              ↳ Narrow

                ↳ AND

                  ↳ QDP

                  ↳ QDP

Q DP problem:
P is empty.
R is empty.
Q is empty.
We have to consider all (P,Q,R)-chains.

takeWhile	p []	= takeWhile3 p []
takeWhile	p (x : xs)	= takeWhile2 p (x : xs)

takeWhile1	p x xs True	= x : takeWhile p xs
takeWhile1	p x xs False	= takeWhile0 p x xs otherwise

numericEnumFromThenToP1	wv ww wx True	= flip (<=) wv
numericEnumFromThenToP1	wv ww wx False	= numericEnumFromThenToP0 wv ww wx otherwise